TSTP Solution File: LCL166-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL166-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:23:58 EDT 2023
% Result : Unsatisfiable 1.30s 0.63s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 3
% Syntax : Number of clauses : 53 ( 10 unt; 0 nHn; 30 RR)
% Number of literals : 122 ( 0 equ; 71 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 140 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PTWVTPmRg7/E---3.1_32615.p',condensed_detachment) ).
cnf(xhn,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
file('/export/starexec/sandbox/tmp/tmp.PTWVTPmRg7/E---3.1_32615.p',xhn) ).
cnf(prove_um,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
file('/export/starexec/sandbox/tmp/tmp.PTWVTPmRg7/E---3.1_32615.p',prove_um) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
xhn ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X4),X2)))
| ~ is_a_theorem(equivalent(X1,X4)) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X3,X4)),X1)),X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X1,X4)),X2))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,equivalent(X4,X1))))
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X3)))
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X3))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X1)))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_23,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_4]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,equivalent(X4,X1)),X2)),X4)) ),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_30,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_32,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_4]) ).
cnf(c_0_34,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_4]) ).
cnf(c_0_35,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_38,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_37]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X3))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_40]) ).
cnf(c_0_42,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X3,X1)),X2),X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_43,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_44,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_44,c_0_4]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_47,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)),X3)),
inference(spm,[status(thm)],[c_0_46,c_0_4]) ).
cnf(c_0_48,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_47]) ).
cnf(c_0_49,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X1),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
prove_um ).
cnf(c_0_51,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL166-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:44:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.PTWVTPmRg7/E---3.1_32615.p
% 1.30/0.63 # Version: 3.1pre001
% 1.30/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.30/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.30/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.30/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.30/0.63 # Starting sh5l with 300s (1) cores
% 1.30/0.63 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32699 completed with status 0
% 1.30/0.63 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.30/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.30/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.30/0.63 # No SInE strategy applied
% 1.30/0.63 # Search class: FHUNF-FFSF22-MFFFFFNN
% 1.30/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.30/0.63 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 1.30/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.30/0.63 # Starting new_bool_3 with 136s (1) cores
% 1.30/0.63 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.30/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 1.30/0.63 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 32704 completed with status 0
% 1.30/0.63 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 1.30/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.30/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.30/0.63 # No SInE strategy applied
% 1.30/0.63 # Search class: FHUNF-FFSF22-MFFFFFNN
% 1.30/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.30/0.63 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 1.30/0.63 # Preprocessing time : 0.001 s
% 1.30/0.63
% 1.30/0.63 # Proof found!
% 1.30/0.63 # SZS status Unsatisfiable
% 1.30/0.63 # SZS output start CNFRefutation
% See solution above
% 1.30/0.63 # Parsed axioms : 3
% 1.30/0.63 # Removed by relevancy pruning/SinE : 0
% 1.30/0.63 # Initial clauses : 3
% 1.30/0.63 # Removed in clause preprocessing : 0
% 1.30/0.63 # Initial clauses in saturation : 3
% 1.30/0.63 # Processed clauses : 3804
% 1.30/0.63 # ...of these trivial : 39
% 1.30/0.63 # ...subsumed : 3462
% 1.30/0.63 # ...remaining for further processing : 303
% 1.30/0.63 # Other redundant clauses eliminated : 0
% 1.30/0.63 # Clauses deleted for lack of memory : 0
% 1.30/0.63 # Backward-subsumed : 5
% 1.30/0.63 # Backward-rewritten : 4
% 1.30/0.63 # Generated clauses : 14192
% 1.30/0.63 # ...of the previous two non-redundant : 9750
% 1.30/0.63 # ...aggressively subsumed : 0
% 1.30/0.63 # Contextual simplify-reflections : 0
% 1.30/0.63 # Paramodulations : 14192
% 1.30/0.63 # Factorizations : 0
% 1.30/0.63 # NegExts : 0
% 1.30/0.63 # Equation resolutions : 0
% 1.30/0.63 # Total rewrite steps : 4908
% 1.30/0.63 # Propositional unsat checks : 0
% 1.30/0.63 # Propositional check models : 0
% 1.30/0.63 # Propositional check unsatisfiable : 0
% 1.30/0.63 # Propositional clauses : 0
% 1.30/0.63 # Propositional clauses after purity: 0
% 1.30/0.63 # Propositional unsat core size : 0
% 1.30/0.63 # Propositional preprocessing time : 0.000
% 1.30/0.63 # Propositional encoding time : 0.000
% 1.30/0.63 # Propositional solver time : 0.000
% 1.30/0.63 # Success case prop preproc time : 0.000
% 1.30/0.63 # Success case prop encoding time : 0.000
% 1.30/0.63 # Success case prop solver time : 0.000
% 1.30/0.63 # Current number of processed clauses : 294
% 1.30/0.63 # Positive orientable unit clauses : 93
% 1.30/0.63 # Positive unorientable unit clauses: 0
% 1.30/0.63 # Negative unit clauses : 1
% 1.30/0.63 # Non-unit-clauses : 200
% 1.30/0.63 # Current number of unprocessed clauses: 5914
% 1.30/0.63 # ...number of literals in the above : 15916
% 1.30/0.63 # Current number of archived formulas : 0
% 1.30/0.63 # Current number of archived clauses : 9
% 1.30/0.63 # Clause-clause subsumption calls (NU) : 57468
% 1.30/0.63 # Rec. Clause-clause subsumption calls : 57307
% 1.30/0.63 # Non-unit clause-clause subsumptions : 3466
% 1.30/0.63 # Unit Clause-clause subsumption calls : 1070
% 1.30/0.63 # Rewrite failures with RHS unbound : 0
% 1.30/0.63 # BW rewrite match attempts : 7555
% 1.30/0.63 # BW rewrite match successes : 4
% 1.30/0.63 # Condensation attempts : 0
% 1.30/0.63 # Condensation successes : 0
% 1.30/0.63 # Termbank termtop insertions : 138905
% 1.30/0.63
% 1.30/0.63 # -------------------------------------------------
% 1.30/0.63 # User time : 0.137 s
% 1.30/0.63 # System time : 0.010 s
% 1.30/0.63 # Total time : 0.147 s
% 1.30/0.63 # Maximum resident set size: 1580 pages
% 1.30/0.63
% 1.30/0.63 # -------------------------------------------------
% 1.30/0.63 # User time : 0.706 s
% 1.30/0.63 # System time : 0.030 s
% 1.30/0.63 # Total time : 0.736 s
% 1.30/0.63 # Maximum resident set size: 1676 pages
% 1.30/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------