TSTP Solution File: LCL101-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:11:32 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 22 ( 15 unt; 0 nHn; 9 RR)
% Number of literals : 31 ( 0 equ; 11 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 0 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.V5vYsTYHH9/E---3.1_16399.p',condensed_detachment) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
file('/export/starexec/sandbox/tmp/tmp.V5vYsTYHH9/E---3.1_16399.p',lg_2) ).
cnf(p_4,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1))),
file('/export/starexec/sandbox/tmp/tmp.V5vYsTYHH9/E---3.1_16399.p',p_4) ).
cnf(prove_p_1,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox/tmp/tmp.V5vYsTYHH9/E---3.1_16399.p',prove_p_1) ).
cnf(c_0_4,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
lg_2 ).
cnf(c_0_6,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1))),
p_4 ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),equivalent(X5,X6)))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),equivalent(X1,equivalent(X3,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X2),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4))),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
prove_p_1 ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 12:00:14 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.V5vYsTYHH9/E---3.1_16399.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # sh5l with pid 16480 completed with status 0
% 0.23/0.54 # Result found by sh5l
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 0.23/0.54 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 16484 completed with status 0
% 0.23/0.54 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 4
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 4
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 4
% 0.23/0.54 # Processed clauses : 131
% 0.23/0.54 # ...of these trivial : 16
% 0.23/0.54 # ...subsumed : 46
% 0.23/0.54 # ...remaining for further processing : 69
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 0
% 0.23/0.54 # Backward-rewritten : 2
% 0.23/0.54 # Generated clauses : 669
% 0.23/0.54 # ...of the previous two non-redundant : 385
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 669
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 275
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 67
% 0.23/0.54 # Positive orientable unit clauses : 44
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 23
% 0.23/0.54 # Current number of unprocessed clauses: 258
% 0.23/0.54 # ...number of literals in the above : 383
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 2
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 191
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 191
% 0.23/0.54 # Non-unit clause-clause subsumptions : 46
% 0.23/0.54 # Unit Clause-clause subsumption calls : 16
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 1099
% 0.23/0.54 # BW rewrite match successes : 2
% 0.23/0.54 # Condensation attempts : 131
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 8005
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.007 s
% 0.23/0.54 # System time : 0.004 s
% 0.23/0.54 # Total time : 0.011 s
% 0.23/0.54 # Maximum resident set size: 1640 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.007 s
% 0.23/0.54 # System time : 0.007 s
% 0.23/0.54 # Total time : 0.015 s
% 0.23/0.54 # Maximum resident set size: 1680 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------