TSTP Solution File: PUZ027-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ027-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 300s
% DateTime : Tue May 21 02:24:43 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 50 ( 10 unt; 4 nHn; 48 RR)
% Number of literals : 119 ( 0 equ; 79 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-1 aty)
% Number of variables : 5 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a_and_b_normal,hypothesis,
( answer(a_and_b_normal)
| ~ a_truth(normal(a))
| ~ a_truth(normal(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_and_b_normal) ).
cnf(prove_there_is_an_answer,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_an_answer) ).
cnf(a_liar_b_normal,hypothesis,
( answer(a_liar_b_normal)
| ~ a_truth(liar(a))
| ~ a_truth(normal(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_liar_b_normal) ).
cnf(a_truthteller_b_normal,hypothesis,
( answer(a_truthteller_b_normal)
| ~ a_truth(truthteller(a))
| ~ a_truth(normal(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_truthteller_b_normal) ).
cnf(a_normal_b_liar,hypothesis,
( answer(a_normal_b_liar)
| ~ a_truth(normal(a))
| ~ a_truth(liar(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_normal_b_liar) ).
cnf(person_is_one_type,axiom,
( a_truth(truthteller(X1))
| a_truth(liar(X1))
| a_truth(normal(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PUZ003-0.ax',person_is_one_type) ).
cnf(a_normal_b_truthteller,hypothesis,
( answer(a_normal_b_truthteller)
| ~ a_truth(normal(a))
| ~ a_truth(truthteller(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_normal_b_truthteller) ).
cnf(a_and_b_liar,hypothesis,
( answer(a_and_b_liar)
| ~ a_truth(liar(a))
| ~ a_truth(liar(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_and_b_liar) ).
cnf(a_truthteller_b_liar,hypothesis,
( answer(a_truthteller_b_liar)
| ~ a_truth(truthteller(a))
| ~ a_truth(liar(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_truthteller_b_liar) ).
cnf(a_liar_b_truthteller,hypothesis,
( answer(a_liar_b_truthteller)
| ~ a_truth(liar(a))
| ~ a_truth(truthteller(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_liar_b_truthteller) ).
cnf(a_and_b_truthteller,hypothesis,
( answer(a_and_b_truthteller)
| ~ a_truth(truthteller(a))
| ~ a_truth(truthteller(b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_and_b_truthteller) ).
cnf(c_0_11,hypothesis,
( answer(a_and_b_normal)
| ~ a_truth(normal(a))
| ~ a_truth(normal(b)) ),
inference(fof_simplification,[status(thm)],[a_and_b_normal]) ).
cnf(c_0_12,negated_conjecture,
~ answer(X1),
inference(fof_simplification,[status(thm)],[prove_there_is_an_answer]) ).
cnf(c_0_13,hypothesis,
( answer(a_liar_b_normal)
| ~ a_truth(liar(a))
| ~ a_truth(normal(b)) ),
inference(fof_simplification,[status(thm)],[a_liar_b_normal]) ).
cnf(c_0_14,hypothesis,
( answer(a_truthteller_b_normal)
| ~ a_truth(truthteller(a))
| ~ a_truth(normal(b)) ),
inference(fof_simplification,[status(thm)],[a_truthteller_b_normal]) ).
cnf(c_0_15,hypothesis,
( answer(a_and_b_normal)
| ~ a_truth(normal(a))
| ~ a_truth(normal(b)) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
~ answer(X1),
c_0_12 ).
cnf(c_0_17,hypothesis,
( answer(a_liar_b_normal)
| ~ a_truth(liar(a))
| ~ a_truth(normal(b)) ),
c_0_13 ).
cnf(c_0_18,hypothesis,
( answer(a_truthteller_b_normal)
| ~ a_truth(truthteller(a))
| ~ a_truth(normal(b)) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
( answer(a_normal_b_liar)
| ~ a_truth(normal(a))
| ~ a_truth(liar(b)) ),
inference(fof_simplification,[status(thm)],[a_normal_b_liar]) ).
cnf(c_0_20,hypothesis,
( ~ a_truth(normal(a))
| ~ a_truth(normal(b)) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
( a_truth(truthteller(X1))
| a_truth(liar(X1))
| a_truth(normal(X1)) ),
person_is_one_type ).
cnf(c_0_22,hypothesis,
( ~ a_truth(liar(a))
| ~ a_truth(normal(b)) ),
inference(sr,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,hypothesis,
( ~ a_truth(truthteller(a))
| ~ a_truth(normal(b)) ),
inference(sr,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_24,hypothesis,
( answer(a_normal_b_truthteller)
| ~ a_truth(normal(a))
| ~ a_truth(truthteller(b)) ),
inference(fof_simplification,[status(thm)],[a_normal_b_truthteller]) ).
cnf(c_0_25,hypothesis,
( answer(a_normal_b_liar)
| ~ a_truth(normal(a))
| ~ a_truth(liar(b)) ),
c_0_19 ).
cnf(c_0_26,hypothesis,
~ a_truth(normal(b)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_27,hypothesis,
( answer(a_normal_b_truthteller)
| ~ a_truth(normal(a))
| ~ a_truth(truthteller(b)) ),
c_0_24 ).
cnf(c_0_28,hypothesis,
( answer(a_and_b_liar)
| ~ a_truth(liar(a))
| ~ a_truth(liar(b)) ),
inference(fof_simplification,[status(thm)],[a_and_b_liar]) ).
cnf(c_0_29,hypothesis,
( ~ a_truth(liar(b))
| ~ a_truth(normal(a)) ),
inference(sr,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_30,hypothesis,
( a_truth(liar(b))
| a_truth(truthteller(b)) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_31,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(normal(a)) ),
inference(sr,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,hypothesis,
( answer(a_truthteller_b_liar)
| ~ a_truth(truthteller(a))
| ~ a_truth(liar(b)) ),
inference(fof_simplification,[status(thm)],[a_truthteller_b_liar]) ).
cnf(c_0_33,hypothesis,
( answer(a_and_b_liar)
| ~ a_truth(liar(a))
| ~ a_truth(liar(b)) ),
c_0_28 ).
cnf(c_0_34,hypothesis,
~ a_truth(normal(a)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,hypothesis,
( answer(a_truthteller_b_liar)
| ~ a_truth(truthteller(a))
| ~ a_truth(liar(b)) ),
c_0_32 ).
cnf(c_0_36,hypothesis,
( answer(a_liar_b_truthteller)
| ~ a_truth(liar(a))
| ~ a_truth(truthteller(b)) ),
inference(fof_simplification,[status(thm)],[a_liar_b_truthteller]) ).
cnf(c_0_37,hypothesis,
( ~ a_truth(liar(a))
| ~ a_truth(liar(b)) ),
inference(sr,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_38,hypothesis,
( a_truth(liar(a))
| a_truth(truthteller(a)) ),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_39,hypothesis,
( ~ a_truth(truthteller(a))
| ~ a_truth(liar(b)) ),
inference(sr,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_40,hypothesis,
( answer(a_liar_b_truthteller)
| ~ a_truth(liar(a))
| ~ a_truth(truthteller(b)) ),
c_0_36 ).
cnf(c_0_41,hypothesis,
~ a_truth(liar(b)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,hypothesis,
( answer(a_and_b_truthteller)
| ~ a_truth(truthteller(a))
| ~ a_truth(truthteller(b)) ),
inference(fof_simplification,[status(thm)],[a_and_b_truthteller]) ).
cnf(c_0_43,hypothesis,
( ~ a_truth(truthteller(b))
| ~ a_truth(liar(a)) ),
inference(sr,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_44,hypothesis,
a_truth(truthteller(b)),
inference(sr,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_45,hypothesis,
( answer(a_and_b_truthteller)
| ~ a_truth(truthteller(a))
| ~ a_truth(truthteller(b)) ),
c_0_42 ).
cnf(c_0_46,hypothesis,
~ a_truth(liar(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,hypothesis,
( ~ a_truth(truthteller(a))
| ~ a_truth(truthteller(b)) ),
inference(sr,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_48,hypothesis,
a_truth(truthteller(a)),
inference(sr,[status(thm)],[c_0_38,c_0_46]) ).
cnf(c_0_49,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_44])]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : PUZ027-1 : TPTP v8.2.0. Released v1.0.0.
% 0.09/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 10:25:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 13970 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 13976 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 32
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 32
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 32
% 0.21/0.50 # Processed clauses : 74
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 2
% 0.21/0.50 # ...remaining for further processing : 71
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 7
% 0.21/0.50 # Backward-rewritten : 4
% 0.21/0.50 # Generated clauses : 30
% 0.21/0.50 # ...of the previous two non-redundant : 31
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 5
% 0.21/0.50 # Paramodulations : 28
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 5
% 0.21/0.50 # ...of those cached : 3
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 26
% 0.21/0.50 # Positive orientable unit clauses : 5
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 6
% 0.21/0.50 # Non-unit-clauses : 15
% 0.21/0.50 # Current number of unprocessed clauses: 21
% 0.21/0.50 # ...number of literals in the above : 53
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 45
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 192
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 129
% 0.21/0.50 # Non-unit clause-clause subsumptions : 5
% 0.21/0.50 # Unit Clause-clause subsumption calls : 13
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1648
% 0.21/0.50 # Search garbage collected termcells : 73
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.008 s
% 0.21/0.50 # System time : 0.000 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1756 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.010 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1764 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------