TSTP Solution File: LCL128-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL128-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:50 EDT 2023
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 55 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 3 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.KUTB87VtMi/E---3.1_8683.p',condensed_detachment) ).
cnf(s_3,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))),
file('/export/starexec/sandbox/tmp/tmp.KUTB87VtMi/E---3.1_8683.p',s_3) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/tmp/tmp.KUTB87VtMi/E---3.1_8683.p',prove_lg_2) ).
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(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))),
s_3 ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X4))) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X4,equivalent(X1,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
prove_lg_2 ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,equivalent(c,e)),equivalent(b,c))))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,e)))) ),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X5)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X4),X5))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,e),equivalent(b,e))))
| ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,c),equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(X1,b))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_9]),c_0_9]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)),X5)),X5))),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL128-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 12:39:49 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 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.KUTB87VtMi/E---3.1_8683.p
% 0.19/0.47 # Version: 3.1pre001
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8760 completed with status 0
% 0.19/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.47 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.19/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 8771 completed with status 0
% 0.19/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.47 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Unsatisfiable
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 3
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 3
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 3
% 0.19/0.47 # Processed clauses : 67
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 16
% 0.19/0.47 # ...remaining for further processing : 51
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 6
% 0.19/0.47 # Backward-rewritten : 1
% 0.19/0.47 # Generated clauses : 263
% 0.19/0.47 # ...of the previous two non-redundant : 250
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 2
% 0.19/0.47 # Paramodulations : 263
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Total rewrite steps : 7
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 41
% 0.19/0.47 # Positive orientable unit clauses : 4
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 4
% 0.19/0.47 # Non-unit-clauses : 33
% 0.19/0.47 # Current number of unprocessed clauses: 181
% 0.19/0.47 # ...number of literals in the above : 559
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 10
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 430
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 355
% 0.19/0.47 # Non-unit clause-clause subsumptions : 19
% 0.19/0.47 # Unit Clause-clause subsumption calls : 35
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 32
% 0.19/0.47 # BW rewrite match successes : 2
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 4386
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.006 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.006 s
% 0.19/0.47 # Maximum resident set size: 1580 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.028 s
% 0.19/0.47 # System time : 0.006 s
% 0.19/0.47 # Total time : 0.034 s
% 0.19/0.47 # Maximum resident set size: 1676 pages
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------