TSTP Solution File: LCL131-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL131-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:51 EDT 2023
% Result : Unsatisfiable 0.93s 0.58s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 36 ( 18 unt; 0 nHn; 22 RR)
% Number of literals : 61 ( 0 equ; 37 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 : 90 ( 5 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.1bMAZi6Mhj/E---3.1_17302.p',condensed_detachment) ).
cnf(s_6,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1)),
file('/export/starexec/sandbox2/tmp/tmp.1bMAZi6Mhj/E---3.1_17302.p',s_6) ).
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/sandbox2/tmp/tmp.1bMAZi6Mhj/E---3.1_17302.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(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1)),
s_6 ).
cnf(c_0_5,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(X6,X5)),equivalent(X4,X6)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4),equivalent(equivalent(X1,X3),X4))),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X4),equivalent(X2,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,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_16,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_14]) ).
cnf(c_0_17,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_15,c_0_16]) ).
cnf(c_0_18,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_17,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a)) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,c)),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),X2))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a))
| ~ is_a_theorem(equivalent(X2,a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))),equivalent(X1,equivalent(X2,X4)))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,c))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X1,X4),equivalent(X3,equivalent(X4,X2))))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,X2),equivalent(c,X2))),a)),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_30,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X4)) ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X1,X4),equivalent(X3,equivalent(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X2,X4),equivalent(X3,X4))))),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,X2)),a)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL131-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n031.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 12:50:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.1bMAZi6Mhj/E---3.1_17302.p
% 0.93/0.58 # Version: 3.1pre001
% 0.93/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.93/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.58 # Starting sh5l with 300s (1) cores
% 0.93/0.58 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17379 completed with status 0
% 0.93/0.58 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.93/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.93/0.58 # No SInE strategy applied
% 0.93/0.58 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.93/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.58 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.93/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.93/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.93/0.58 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.93/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 17391 completed with status 0
% 0.93/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 0.93/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.93/0.58 # No SInE strategy applied
% 0.93/0.58 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.93/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.58 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.93/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.93/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.93/0.58 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.93/0.58 # Preprocessing time : 0.001 s
% 0.93/0.58 # Presaturation interreduction done
% 0.93/0.58
% 0.93/0.58 # Proof found!
% 0.93/0.58 # SZS status Unsatisfiable
% 0.93/0.58 # SZS output start CNFRefutation
% See solution above
% 0.93/0.58 # Parsed axioms : 3
% 0.93/0.58 # Removed by relevancy pruning/SinE : 0
% 0.93/0.58 # Initial clauses : 3
% 0.93/0.58 # Removed in clause preprocessing : 0
% 0.93/0.58 # Initial clauses in saturation : 3
% 0.93/0.58 # Processed clauses : 700
% 0.93/0.58 # ...of these trivial : 2
% 0.93/0.58 # ...subsumed : 506
% 0.93/0.58 # ...remaining for further processing : 192
% 0.93/0.58 # Other redundant clauses eliminated : 0
% 0.93/0.58 # Clauses deleted for lack of memory : 0
% 0.93/0.58 # Backward-subsumed : 38
% 0.93/0.58 # Backward-rewritten : 1
% 0.93/0.58 # Generated clauses : 4799
% 0.93/0.58 # ...of the previous two non-redundant : 4590
% 0.93/0.58 # ...aggressively subsumed : 0
% 0.93/0.58 # Contextual simplify-reflections : 0
% 0.93/0.58 # Paramodulations : 4799
% 0.93/0.58 # Factorizations : 0
% 0.93/0.58 # NegExts : 0
% 0.93/0.58 # Equation resolutions : 0
% 0.93/0.58 # Total rewrite steps : 203
% 0.93/0.58 # Propositional unsat checks : 0
% 0.93/0.58 # Propositional check models : 0
% 0.93/0.58 # Propositional check unsatisfiable : 0
% 0.93/0.58 # Propositional clauses : 0
% 0.93/0.58 # Propositional clauses after purity: 0
% 0.93/0.58 # Propositional unsat core size : 0
% 0.93/0.58 # Propositional preprocessing time : 0.000
% 0.93/0.58 # Propositional encoding time : 0.000
% 0.93/0.58 # Propositional solver time : 0.000
% 0.93/0.58 # Success case prop preproc time : 0.000
% 0.93/0.58 # Success case prop encoding time : 0.000
% 0.93/0.58 # Success case prop solver time : 0.000
% 0.93/0.58 # Current number of processed clauses : 150
% 0.93/0.58 # Positive orientable unit clauses : 17
% 0.93/0.58 # Positive unorientable unit clauses: 0
% 0.93/0.58 # Negative unit clauses : 25
% 0.93/0.58 # Non-unit-clauses : 108
% 0.93/0.58 # Current number of unprocessed clauses: 3753
% 0.93/0.58 # ...number of literals in the above : 10963
% 0.93/0.58 # Current number of archived formulas : 0
% 0.93/0.58 # Current number of archived clauses : 42
% 0.93/0.58 # Clause-clause subsumption calls (NU) : 5410
% 0.93/0.58 # Rec. Clause-clause subsumption calls : 4056
% 0.93/0.58 # Non-unit clause-clause subsumptions : 268
% 0.93/0.58 # Unit Clause-clause subsumption calls : 883
% 0.93/0.58 # Rewrite failures with RHS unbound : 0
% 0.93/0.58 # BW rewrite match attempts : 254
% 0.93/0.58 # BW rewrite match successes : 1
% 0.93/0.58 # Condensation attempts : 0
% 0.93/0.58 # Condensation successes : 0
% 0.93/0.58 # Termbank termtop insertions : 77424
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.099 s
% 0.93/0.58 # System time : 0.003 s
% 0.93/0.58 # Total time : 0.103 s
% 0.93/0.58 # Maximum resident set size: 1576 pages
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.433 s
% 0.93/0.58 # System time : 0.024 s
% 0.93/0.58 # Total time : 0.457 s
% 0.93/0.58 # Maximum resident set size: 1672 pages
% 0.93/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------