TSTP Solution File: LCL014-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL014-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Sat May 4 08:26:07 EDT 2024
% Result : Unsatisfiable 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 19 unt; 0 nHn; 13 RR)
% Number of literals : 47 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 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 : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QICjQ7XdHK/E---3.1_31713.p',condensed_detachment) ).
cnf(wn,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X1,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.QICjQ7XdHK/E---3.1_31713.p',wn) ).
cnf(prove_xgf,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
file('/export/starexec/sandbox2/tmp/tmp.QICjQ7XdHK/E---3.1_31713.p',prove_xgf) ).
cnf(c_0_3,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X1,X2)))),
wn ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,equivalent(X2,X3)),X3))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| ~ is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,equivalent(X3,X1))))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,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_4,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X3))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X1),X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(equivalent(X2,X3),X1))))),
inference(spm,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(equivalent(X1,X2),X3)),X3))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X3)),X3),X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),equivalent(X3,X2))),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X2),equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_22]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
inference(fof_simplification,[status(thm)],[prove_xgf]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X1),X2))),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
c_0_26 ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL014-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n002.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 09:14:12 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.QICjQ7XdHK/E---3.1_31713.p
% 0.15/0.49 # Version: 3.1.0
% 0.15/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 # Starting sh5l with 300s (1) cores
% 0.15/0.49 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31790 completed with status 0
% 0.15/0.49 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.49 # No SInE strategy applied
% 0.15/0.49 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.15/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.49 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.15/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.49 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.15/0.49 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 31794 completed with status 0
% 0.15/0.49 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.15/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.49 # No SInE strategy applied
% 0.15/0.49 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.15/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.49 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.15/0.49 # Preprocessing time : 0.001 s
% 0.15/0.49
% 0.15/0.49 # Proof found!
% 0.15/0.49 # SZS status Unsatisfiable
% 0.15/0.49 # SZS output start CNFRefutation
% See solution above
% 0.15/0.49 # Parsed axioms : 3
% 0.15/0.49 # Removed by relevancy pruning/SinE : 0
% 0.15/0.49 # Initial clauses : 3
% 0.15/0.49 # Removed in clause preprocessing : 0
% 0.15/0.49 # Initial clauses in saturation : 3
% 0.15/0.49 # Processed clauses : 988
% 0.15/0.49 # ...of these trivial : 294
% 0.15/0.49 # ...subsumed : 70
% 0.15/0.49 # ...remaining for further processing : 624
% 0.15/0.49 # Other redundant clauses eliminated : 0
% 0.15/0.49 # Clauses deleted for lack of memory : 0
% 0.15/0.49 # Backward-subsumed : 0
% 0.15/0.49 # Backward-rewritten : 1
% 0.15/0.49 # Generated clauses : 6536
% 0.15/0.49 # ...of the previous two non-redundant : 3878
% 0.15/0.49 # ...aggressively subsumed : 0
% 0.15/0.49 # Contextual simplify-reflections : 0
% 0.15/0.49 # Paramodulations : 6536
% 0.15/0.49 # Factorizations : 0
% 0.15/0.49 # NegExts : 0
% 0.15/0.49 # Equation resolutions : 0
% 0.15/0.49 # Disequality decompositions : 0
% 0.15/0.49 # Total rewrite steps : 3036
% 0.15/0.49 # ...of those cached : 2479
% 0.15/0.49 # Propositional unsat checks : 0
% 0.15/0.49 # Propositional check models : 0
% 0.15/0.49 # Propositional check unsatisfiable : 0
% 0.15/0.49 # Propositional clauses : 0
% 0.15/0.49 # Propositional clauses after purity: 0
% 0.15/0.49 # Propositional unsat core size : 0
% 0.15/0.49 # Propositional preprocessing time : 0.000
% 0.15/0.49 # Propositional encoding time : 0.000
% 0.15/0.49 # Propositional solver time : 0.000
% 0.15/0.49 # Success case prop preproc time : 0.000
% 0.15/0.49 # Success case prop encoding time : 0.000
% 0.15/0.49 # Success case prop solver time : 0.000
% 0.15/0.49 # Current number of processed clauses : 623
% 0.15/0.49 # Positive orientable unit clauses : 597
% 0.15/0.49 # Positive unorientable unit clauses: 0
% 0.15/0.49 # Negative unit clauses : 0
% 0.15/0.49 # Non-unit-clauses : 26
% 0.15/0.49 # Current number of unprocessed clauses: 2893
% 0.15/0.49 # ...number of literals in the above : 5196
% 0.15/0.49 # Current number of archived formulas : 0
% 0.15/0.49 # Current number of archived clauses : 1
% 0.15/0.49 # Clause-clause subsumption calls (NU) : 338
% 0.15/0.49 # Rec. Clause-clause subsumption calls : 338
% 0.15/0.49 # Non-unit clause-clause subsumptions : 70
% 0.15/0.49 # Unit Clause-clause subsumption calls : 65
% 0.15/0.49 # Rewrite failures with RHS unbound : 0
% 0.15/0.49 # BW rewrite match attempts : 97995
% 0.15/0.49 # BW rewrite match successes : 1
% 0.15/0.49 # Condensation attempts : 0
% 0.15/0.49 # Condensation successes : 0
% 0.15/0.49 # Termbank termtop insertions : 68338
% 0.15/0.49 # Search garbage collected termcells : 8
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.070 s
% 0.15/0.49 # System time : 0.003 s
% 0.15/0.49 # Total time : 0.073 s
% 0.15/0.49 # Maximum resident set size: 1592 pages
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.350 s
% 0.15/0.49 # System time : 0.016 s
% 0.15/0.49 # Total time : 0.366 s
% 0.15/0.49 # Maximum resident set size: 1692 pages
% 0.15/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------