TSTP Solution File: PUZ007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 18:23:49 EDT 2022
% Result : Unsatisfiable 0.75s 1.02s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat May 28 20:59:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.02 ============================== Prover9 ===============================
% 0.75/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.02 Process 17436 was started by sandbox on n023.cluster.edu,
% 0.75/1.02 Sat May 28 20:59:13 2022
% 0.75/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17283_n023.cluster.edu".
% 0.75/1.02 ============================== end of head ===========================
% 0.75/1.02
% 0.75/1.02 ============================== INPUT =================================
% 0.75/1.02
% 0.75/1.02 % Reading from file /tmp/Prover9_17283_n023.cluster.edu
% 0.75/1.02
% 0.75/1.02 set(prolog_style_variables).
% 0.75/1.02 set(auto2).
% 0.75/1.02 % set(auto2) -> set(auto).
% 0.75/1.02 % set(auto) -> set(auto_inference).
% 0.75/1.02 % set(auto) -> set(auto_setup).
% 0.75/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.02 % set(auto) -> set(auto_limits).
% 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.02 % set(auto) -> set(auto_denials).
% 0.75/1.02 % set(auto) -> set(auto_process).
% 0.75/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.02 % set(auto2) -> assign(stats, some).
% 0.75/1.02 % set(auto2) -> clear(echo_input).
% 0.75/1.02 % set(auto2) -> set(quiet).
% 0.75/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.02 % set(auto2) -> clear(print_given).
% 0.75/1.02 assign(lrs_ticks,-1).
% 0.75/1.02 assign(sos_limit,10000).
% 0.75/1.02 assign(order,kbo).
% 0.75/1.02 set(lex_order_vars).
% 0.75/1.02 clear(print_given).
% 0.75/1.02
% 0.75/1.02 % formulas(sos). % not echoed (28 formulas)
% 0.75/1.02
% 0.75/1.02 ============================== end of input ==========================
% 0.75/1.02
% 0.75/1.02 % From the command line: assign(max_seconds, 300).
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.02
% 0.75/1.02 % Formulas that are not ordinary clauses:
% 0.75/1.02
% 0.75/1.02 ============================== end of process non-clausal formulas ===
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.02
% 0.75/1.02 ============================== PREDICATE ELIMINATION =================
% 0.75/1.02 1 -liar(A) | -says(A,B) | -a_truth(B) # label(liars_make_false_statements) # label(axiom). [assumption].
% 0.75/1.02 2 says(a,a_from_mars) # label(a_says_hes_from_mars) # label(hypothesis). [assumption].
% 0.75/1.02 3 says(b,a_has_lied) # label(b_says_a_lies) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -liar(a) | -a_truth(a_from_mars). [resolve(1,b,2,a)].
% 0.75/1.02 Derived: -liar(b) | -a_truth(a_has_lied). [resolve(1,b,3,a)].
% 0.75/1.02 4 -says(A,B) | a_truth(B) | -a_truth(B) # label(statements_are_true_or_not) # label(axiom). [assumption].
% 0.75/1.02 5 -says(A,B) | B = statement_by(A) # label(people_say_their_statements) # label(axiom). [assumption].
% 0.75/1.02 Derived: a_from_mars = statement_by(a). [resolve(5,a,2,a)].
% 0.75/1.02 Derived: a_has_lied = statement_by(b). [resolve(5,a,3,a)].
% 0.75/1.02 6 -truthteller(A) | -says(A,B) | a_truth(B) # label(truthtellers_make_true_statements) # label(axiom). [assumption].
% 0.75/1.02 Derived: -truthteller(a) | a_truth(a_from_mars). [resolve(6,b,2,a)].
% 0.75/1.02 Derived: -truthteller(b) | a_truth(a_has_lied). [resolve(6,b,3,a)].
% 0.75/1.02
% 0.75/1.02 ============================== end predicate elimination =============
% 0.75/1.02
% 0.75/1.02 Auto_denials: (non-Horn, no changes).
% 0.75/1.02
% 0.75/1.02 Term ordering decisions:
% 0.75/1.02
% 0.75/1.02 % Assigning unary symbol statement_by kb_weight 0 and highest precedence (13).
% 0.75/1.02 Function symbol KB weights: a=1. b=1. a_from_mars=1. a_has_lied=1. statement_by=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of process initial clauses ========
% 0.75/1.02
% 0.75/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.02
% 0.75/1.02 ============================== end of clauses for search =============
% 0.75/1.02
% 0.75/1.02 ============================== SEARCH ================================
% 0.75/1.02
% 0.75/1.02 % Starting search at 0.01 seconds.
% 0.75/1.02
% 0.75/1.02 ============================== PROOF =================================
% 0.75/1.02 % SZS status Unsatisfiable
% 0.75/1.02 % SZS output start Refutation
% 0.75/1.02
% 0.75/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.02 % Length of proof is 47.
% 0.75/1.02 % Level of proof is 13.
% 0.75/1.02 % Maximum clause weight is 8.000.
% 0.75/1.02 % Given clauses 65.
% 0.75/1.02
% 0.75/1.02 1 -liar(A) | -says(A,B) | -a_truth(B) # label(liars_make_false_statements) # label(axiom). [assumption].
% 0.75/1.02 2 says(a,a_from_mars) # label(a_says_hes_from_mars) # label(hypothesis). [assumption].
% 0.75/1.02 7 from_mars(A) | from_venus(A) # label(from_mars_or_venus) # label(axiom). [assumption].
% 0.75/1.02 8 male(A) | female(A) # label(male_or_female) # label(axiom). [assumption].
% 0.75/1.02 10 statement_by(a) = a_from_mars # label(a_states) # label(hypothesis). [assumption].
% 0.75/1.02 11 a_from_mars = statement_by(a). [copy(10),flip(a)].
% 0.75/1.02 14 from_mars(b) | from_mars(a) # label(one_from_mars) # label(negated_conjecture). [assumption].
% 0.75/1.02 15 from_venus(a) | from_venus(b) # label(one_from_venus) # label(negated_conjecture). [assumption].
% 0.75/1.02 16 a_truth(statement_by(A)) | liar(A) # label(false_statements_made_by_liars) # label(axiom). [assumption].
% 0.75/1.02 17 a_truth(a_from_mars) | a_truth(statement_by(b)) # label(truth_of_bs_statement) # label(hypothesis). [assumption].
% 0.75/1.02 18 a_truth(statement_by(a)) | a_truth(statement_by(b)). [copy(17),rewrite([11(1)])].
% 0.75/1.02 19 -from_mars(A) | -from_venus(A) # label(not_from_mars_and_venus) # label(axiom). [assumption].
% 0.75/1.02 21 -truthteller(A) | -liar(A) # label(not_truthteller_and_liar) # label(axiom). [assumption].
% 0.75/1.02 22 -a_truth(a_from_mars) | -a_truth(statement_by(b)) # label(a_from_mars3) # label(hypothesis). [assumption].
% 0.75/1.02 23 -a_truth(statement_by(a)) | -a_truth(statement_by(b)). [copy(22),rewrite([11(1)])].
% 0.75/1.02 24 -from_mars(a) | a_truth(a_from_mars) # label(a_from_mars1) # label(hypothesis). [assumption].
% 0.75/1.02 25 -from_mars(a) | a_truth(statement_by(a)). [copy(24),rewrite([11(3)])].
% 0.75/1.02 26 from_mars(a) | -a_truth(a_from_mars) # label(a_from_mars2) # label(hypothesis). [assumption].
% 0.75/1.02 27 from_mars(a) | -a_truth(statement_by(a)). [copy(26),rewrite([11(3)])].
% 0.75/1.02 29 -male(a) | female(b) # label(different_sex2) # label(hypothesis). [assumption].
% 0.75/1.02 30 -a_truth(statement_by(A)) | truthteller(A) # label(true_statements_made_by_truthtellers) # label(axiom). [assumption].
% 0.75/1.02 31 -from_venus(A) | -female(A) | truthteller(A) # label(venusian_female_are_truthtellers) # label(axiom). [assumption].
% 0.75/1.02 34 -from_mars(A) | -female(A) | liar(A) # label(marsian_females_are_liars) # label(axiom). [assumption].
% 0.75/1.02 35 -liar(a) | -a_truth(a_from_mars). [resolve(1,b,2,a)].
% 0.75/1.02 36 -liar(a) | -a_truth(statement_by(a)). [copy(35),rewrite([11(3)])].
% 0.75/1.02 45 -from_mars(b) | from_venus(a). [resolve(19,b,15,b)].
% 0.75/1.02 46 -truthteller(A) | a_truth(statement_by(A)). [resolve(21,b,16,b)].
% 0.75/1.02 47 female(b) | female(a). [resolve(29,a,8,a)].
% 0.75/1.02 48 truthteller(b) | a_truth(statement_by(a)). [resolve(30,a,18,b)].
% 0.75/1.02 50 -female(A) | truthteller(A) | from_mars(A). [resolve(31,a,7,b)].
% 0.75/1.02 53 female(a) | -from_mars(b) | liar(b). [resolve(47,a,34,b)].
% 0.75/1.02 55 truthteller(b) | from_mars(b) | female(a). [resolve(50,a,47,a)].
% 0.75/1.02 59 female(a) | liar(b) | from_mars(a). [resolve(53,b,14,a)].
% 0.75/1.02 62 truthteller(b) | from_mars(b) | -from_mars(a) | liar(a). [resolve(55,c,34,b)].
% 0.75/1.02 69 female(a) | from_mars(a) | -truthteller(b). [resolve(59,b,21,b)].
% 0.75/1.02 74 female(a) | from_mars(a) | a_truth(statement_by(a)). [resolve(69,c,48,a)].
% 0.75/1.02 76 from_mars(a) | a_truth(statement_by(a)) | truthteller(a). [resolve(74,a,50,a),merge(d)].
% 0.75/1.02 78 from_mars(a) | a_truth(statement_by(a)). [resolve(76,c,46,a),merge(c)].
% 0.75/1.02 80 a_truth(statement_by(a)). [resolve(78,a,25,a),merge(b)].
% 0.75/1.02 82 -liar(a). [back_unit_del(36),unit_del(b,80)].
% 0.75/1.02 83 from_mars(a). [back_unit_del(27),unit_del(b,80)].
% 0.75/1.02 84 -a_truth(statement_by(b)). [back_unit_del(23),unit_del(a,80)].
% 0.75/1.02 85 truthteller(b) | from_mars(b). [back_unit_del(62),unit_del(c,83),unit_del(d,82)].
% 0.75/1.02 87 -from_venus(a). [ur(19,a,83,a)].
% 0.75/1.02 91 -from_mars(b). [back_unit_del(45),unit_del(b,87)].
% 0.75/1.02 93 truthteller(b). [back_unit_del(85),unit_del(b,91)].
% 0.75/1.02 97 $F. [resolve(93,a,46,a),unit_del(a,84)].
% 0.75/1.02
% 0.75/1.02 % SZS output end Refutation
% 0.75/1.02 ============================== end of proof ==========================
% 0.75/1.02
% 0.75/1.02 ============================== STATISTICS ============================
% 0.75/1.02
% 0.75/1.02 Given=65. Generated=127. Kept=78. proofs=1.
% 0.75/1.02 Usable=28. Sos=3. Demods=2. Limbo=0, Disabled=81. Hints=0.
% 0.75/1.02 Megabytes=0.08.
% 0.75/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of statistics =====================
% 0.75/1.02
% 0.75/1.02 ============================== end of search =========================
% 0.75/1.02
% 0.75/1.02 THEOREM PROVED
% 0.75/1.02 % SZS status Unsatisfiable
% 0.75/1.02
% 0.75/1.02 Exiting with 1 proof.
% 0.75/1.02
% 0.75/1.02 Process 17436 exit (max_proofs) Sat May 28 20:59:13 2022
% 0.75/1.02 Prover9 interrupted
%------------------------------------------------------------------------------