TSTP Solution File: LCL013-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL013-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:27 EDT 2023
% Result : Timeout 136.24s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 18 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 19 ( 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.tcJfYcGSM3/E---3.1_16384.p',condensed_detachment) ).
cnf(xgf,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.tcJfYcGSM3/E---3.1_16384.p',xgf) ).
cnf(prove_um,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
file('/export/starexec/sandbox2/tmp/tmp.tcJfYcGSM3/E---3.1_16384.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,equivalent(X1,X3)),equivalent(X3,X2)))),
xgf ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
prove_um ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : LCL013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 12:51:29 EDT 2023
% 0.10/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.tcJfYcGSM3/E---3.1_16384.p
% 136.24/300.10 # Version: 3.1pre001
% 136.24/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.24/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.24/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.24/300.10 # Starting new_bool_3 with 300s (1) cores
% 136.24/300.10 # Starting new_bool_1 with 300s (1) cores
% 136.24/300.10 # Starting sh5l with 300s (1) cores
% 136.24/300.10 # new_bool_1 with pid 16463 completed with status 0
% 136.24/300.10 # Result found by new_bool_1
% 136.24/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.24/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.24/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.24/300.10 # Starting new_bool_3 with 300s (1) cores
% 136.24/300.10 # Starting new_bool_1 with 300s (1) cores
% 136.24/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 136.24/300.10 # Search class: FHUNF-FFSF22-MFFFFFNN
% 136.24/300.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 136.24/300.10 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 136.24/300.10 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 16466 completed with status 0
% 136.24/300.10 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 136.24/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.24/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.24/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.24/300.10 # Starting new_bool_3 with 300s (1) cores
% 136.24/300.10 # Starting new_bool_1 with 300s (1) cores
% 136.24/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 136.24/300.10 # Search class: FHUNF-FFSF22-MFFFFFNN
% 136.24/300.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 136.24/300.10 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 136.24/300.10 # Preprocessing time : 0.001 s
% 136.24/300.10
% 136.24/300.10 # Proof found!
% 136.24/300.10 # SZS status Unsatisfiable
% 136.24/300.10 # SZS output start CNFRefutation
% See solution above
% 136.24/300.10 # Parsed axioms : 3
% 136.24/300.10 # Removed by relevancy pruning/SinE : 0
% 136.24/300.10 # Initial clauses : 3
% 136.24/300.10 # Removed in clause preprocessing : 0
% 136.24/300.10 # Initial clauses in saturation : 3
% 136.24/300.10 # Processed clauses : 6
% 136.24/300.10 # ...of these trivial : 0
% 136.24/300.10 # ...subsumed : 0
% 136.24/300.10 # ...remaining for further processing : 6
% 136.24/300.10 # Other redundant clauses eliminated : 0
% 136.24/300.10 # Clauses deleted for lack of memory : 0
% 136.24/300.10 # Backward-subsumed : 0
% 136.24/300.10 # Backward-rewritten : 0
% 136.24/300.10 # Generated clauses : 7
% 136.24/300.10 # ...of the previous two non-redundant : 6
% 136.24/300.10 # ...aggressively subsumed : 0
% 136.24/300.10 # Contextual simplify-reflections : 0
% 136.24/300.10 # Paramodulations : 7
% 136.24/300.10 # Factorizations : 0
% 136.24/300.10 # NegExts : 0
% 136.24/300.11 # Equation resolutions : 0
% 136.24/300.11 # Total rewrite steps : 1
% 136.24/300.11 # Propositional unsat checks : 0
% 136.24/300.11 # Propositional check models : 0
% 136.24/300.11 # Propositional check unsatisfiable : 0
% 136.24/300.11 # Propositional clauses : 0
% 136.24/300.11 # Propositional clauses after purity: 0
% 136.24/300.11 # Propositional unsat core size : 0
% 136.24/300.11 # Propositional preprocessing time : 0.000
% 136.24/300.11 # Propositional encoding time : 0.000
% 136.24/300.11 # Propositional solver time : 0.000
% 136.24/300.11 # Success case prop preproc time : 0.000
% 136.24/300.11 # Success case prop encoding time : 0.000
% 136.24/300.11 # Success case prop solver time : 0.000
% 136.24/300.11 # Current number of processed clauses : 6
% 136.24/300.11 # Positive orientable unit clauses : 1
% 136.24/300.11 # Positive unorientable unit clauses: 0
% 136.24/300.11 # Negative unit clauses : 1
% 136.24/300.11 # Non-unit-clauses : 4
% 136.24/300.11 # Current number of unprocessed clauses: 1
% 136.24/300.11 # ...number of literals in the above : 3
% 136.24/300.11 # Current number of archived formulas : 0
% 136.24/300.11 # Current number of archived clauses : 0
% 136.24/300.11 # Clause-clause subsumption calls (NU) : 1
% 136.24/300.11 # Rec. Clause-clause subsumption calls : 1
% 136.24/300.11 # Non-unit clause-clause subsumptions : 0
% 136.24/300.11 # Unit Clause-clause subsumption calls : 0
% 136.24/300.11 # Rewrite failures with RHS unbound : 0
% 136.24/300.11 # BW rewrite match attempts : 0
% 136.24/300.11 # BW rewrite match successes : 0
% 136.24/300.11 # Condensation attempts : 0
% 136.24/300.11 # Condensation successes : 0
% 136.24/300.11 # Termbank termtop insertions : 194
% 136.24/300.11
% 136.24/300.11 # -------------------------------------------------
% 136.24/300.11 # User time : 0.002 s
% 136.24/300.11 # System time : 0.001 s
% 136.24/300.11 # Total time : 0.003 s
% 136.24/300.11 # Maximum resident set size: 1640 pages
% 136.24/300.11
% 136.24/300.11 # -------------------------------------------------
% 136.24/300.11 # User time : 0.003 s
% 136.24/300.11 # System time : 0.002 s
% 136.24/300.11 # Total time : 0.005 s
% 136.24/300.11 # Maximum resident set size: 1676 pages
% 136.24/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------