TSTP Solution File: PUZ025-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ025-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:12:41 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 7 unt; 6 nHn; 19 RR)
% Number of literals : 53 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(liar_denies_truths,axiom,
( answer(no)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(liar(X1))
| ~ a_truth(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',liar_denies_truths) ).
cnf(prove_there_is_an_answer,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',prove_there_is_an_answer) ).
cnf(truthteller_identifies_truths,axiom,
( answer(yes)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(truthteller(X1))
| ~ a_truth(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',truthteller_identifies_truths) ).
cnf(liar_supports_lies,axiom,
( a_truth(X2)
| answer(yes)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(liar(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',liar_supports_lies) ).
cnf(truthteller_denies_lies,axiom,
( a_truth(X2)
| answer(no)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(truthteller(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',truthteller_denies_lies) ).
cnf(ask_c_if_a_and_b_equal,hypothesis,
ask_1_if_2(c,equal_type(a,b)),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',ask_c_if_a_and_b_equal) ).
cnf(truthteller_or_liar,axiom,
( a_truth(truthteller(X1))
| a_truth(liar(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p',truthteller_or_liar) ).
cnf(c_0_7,axiom,
( answer(no)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(liar(X1))
| ~ a_truth(X2) ),
liar_denies_truths ).
cnf(c_0_8,negated_conjecture,
~ answer(X1),
prove_there_is_an_answer ).
cnf(c_0_9,axiom,
( answer(yes)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(truthteller(X1))
| ~ a_truth(X2) ),
truthteller_identifies_truths ).
cnf(c_0_10,axiom,
( a_truth(X2)
| answer(yes)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(liar(X1)) ),
liar_supports_lies ).
cnf(c_0_11,plain,
( ~ ask_1_if_2(X1,X2)
| ~ a_truth(liar(X1))
| ~ a_truth(X2) ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,axiom,
( a_truth(X2)
| answer(no)
| ~ ask_1_if_2(X1,X2)
| ~ a_truth(truthteller(X1)) ),
truthteller_denies_lies ).
cnf(c_0_13,plain,
( ~ ask_1_if_2(X1,X2)
| ~ a_truth(truthteller(X1))
| ~ a_truth(X2) ),
inference(sr,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,plain,
( ~ ask_1_if_2(X1,X2)
| ~ a_truth(liar(X1)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_10,c_0_8]),c_0_11]) ).
cnf(c_0_15,hypothesis,
ask_1_if_2(c,equal_type(a,b)),
ask_c_if_a_and_b_equal ).
cnf(c_0_16,plain,
( ~ ask_1_if_2(X1,X2)
| ~ a_truth(truthteller(X1)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_12,c_0_8]),c_0_13]) ).
cnf(c_0_17,hypothesis,
~ a_truth(liar(c)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( a_truth(truthteller(X1))
| a_truth(liar(X1)) ),
truthteller_or_liar ).
cnf(c_0_19,hypothesis,
~ a_truth(truthteller(c)),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 18:44:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.e124WxvkmR/E---3.1_25880.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 25992 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHNF-FFSM21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 25995 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHNF-FFSM21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 24
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 24
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 24
% 0.21/0.52 # Processed clauses : 38
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 38
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 2
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 4
% 0.21/0.52 # ...of the previous two non-redundant : 2
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 2
% 0.21/0.52 # Paramodulations : 4
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 14
% 0.21/0.52 # Positive orientable unit clauses : 5
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 6
% 0.21/0.52 # Current number of unprocessed clauses: 10
% 0.21/0.52 # ...number of literals in the above : 29
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 24
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 53
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 40
% 0.21/0.52 # Non-unit clause-clause subsumptions : 4
% 0.21/0.52 # Unit Clause-clause subsumption calls : 6
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 749
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.001 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.005 s
% 0.21/0.52 # Maximum resident set size: 1608 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.003 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.008 s
% 0.21/0.52 # Maximum resident set size: 1684 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------