TSTP Solution File: SEU406+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU406+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Tue May 21 03:33:01 EDT 2024
% Result : Theorem 5.93s 1.41s
% Output : CNFRefutation 5.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 124 ( 20 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 158 ( 65 ~; 52 |; 35 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 56 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k4_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
& ~ r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d4_xboole_0) ).
fof(t1_latsum_1,conjecture,
! [X1,X2,X3,X4] :
~ ( r2_hidden(X1,k2_xboole_0(X3,X4))
& r2_hidden(X2,k2_xboole_0(X3,X4))
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,k4_xboole_0(X3,X4)) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,k4_xboole_0(X3,X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_latsum_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
| r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k2_xboole_0) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( X3 = k4_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
& ~ r2_hidden(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( r2_hidden(X1,k2_xboole_0(X3,X4))
& r2_hidden(X2,k2_xboole_0(X3,X4))
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,k4_xboole_0(X3,X4)) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,k4_xboole_0(X3,X4)) ) ),
inference(assume_negation,[status(cth)],[t1_latsum_1]) ).
fof(c_0_6,plain,
! [X54,X55,X56,X57,X58,X59,X60,X61] :
( ( r2_hidden(X57,X54)
| ~ r2_hidden(X57,X56)
| X56 != k4_xboole_0(X54,X55) )
& ( ~ r2_hidden(X57,X55)
| ~ r2_hidden(X57,X56)
| X56 != k4_xboole_0(X54,X55) )
& ( ~ r2_hidden(X58,X54)
| r2_hidden(X58,X55)
| r2_hidden(X58,X56)
| X56 != k4_xboole_0(X54,X55) )
& ( ~ r2_hidden(esk8_3(X59,X60,X61),X61)
| ~ r2_hidden(esk8_3(X59,X60,X61),X59)
| r2_hidden(esk8_3(X59,X60,X61),X60)
| X61 = k4_xboole_0(X59,X60) )
& ( r2_hidden(esk8_3(X59,X60,X61),X59)
| r2_hidden(esk8_3(X59,X60,X61),X61)
| X61 = k4_xboole_0(X59,X60) )
& ( ~ r2_hidden(esk8_3(X59,X60,X61),X60)
| r2_hidden(esk8_3(X59,X60,X61),X61)
| X61 = k4_xboole_0(X59,X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])]) ).
fof(c_0_7,plain,
! [X220,X221,X222,X223,X224,X225,X226,X227] :
( ( ~ r2_hidden(X223,X222)
| r2_hidden(X223,X220)
| r2_hidden(X223,X221)
| X222 != k2_xboole_0(X220,X221) )
& ( ~ r2_hidden(X224,X220)
| r2_hidden(X224,X222)
| X222 != k2_xboole_0(X220,X221) )
& ( ~ r2_hidden(X224,X221)
| r2_hidden(X224,X222)
| X222 != k2_xboole_0(X220,X221) )
& ( ~ r2_hidden(esk9_3(X225,X226,X227),X225)
| ~ r2_hidden(esk9_3(X225,X226,X227),X227)
| X227 = k2_xboole_0(X225,X226) )
& ( ~ r2_hidden(esk9_3(X225,X226,X227),X226)
| ~ r2_hidden(esk9_3(X225,X226,X227),X227)
| X227 = k2_xboole_0(X225,X226) )
& ( r2_hidden(esk9_3(X225,X226,X227),X227)
| r2_hidden(esk9_3(X225,X226,X227),X225)
| r2_hidden(esk9_3(X225,X226,X227),X226)
| X227 = k2_xboole_0(X225,X226) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0))
& r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0))
& ( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) )
& ( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) )
& ( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk4_0) )
& ( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X229,X230] : k2_xboole_0(X229,X230) = k2_xboole_0(X230,X229),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_10,plain,
( r2_hidden(X1,X3)
| r2_hidden(X1,X4)
| ~ r2_hidden(X1,X2)
| X4 != k4_xboole_0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( r2_hidden(X1,X3)
| r2_hidden(X1,X4)
| ~ r2_hidden(X1,X2)
| X2 != k2_xboole_0(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
( r2_hidden(esk2_0,esk3_0)
| r2_hidden(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ r2_hidden(esk2_0,esk3_0)
| ~ r2_hidden(esk1_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( ~ r2_hidden(esk2_0,esk4_0)
| ~ r2_hidden(esk1_0,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_18]) ).
cnf(c_0_27,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0)),
inference(rw,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_28,negated_conjecture,
~ r2_hidden(esk1_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_18]) ).
cnf(c_0_29,negated_conjecture,
~ r2_hidden(esk1_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_27]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU406+2 : TPTP v8.2.0. Released v3.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 15:30:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/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/benchmark/theBenchmark.p
% 5.93/1.41 # Version: 3.1.0
% 5.93/1.41 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.93/1.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.93/1.41 # Starting new_bool_3 with 900s (3) cores
% 5.93/1.41 # Starting new_bool_1 with 900s (3) cores
% 5.93/1.41 # Starting sh5l with 300s (1) cores
% 5.93/1.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.93/1.41 # new_bool_1 with pid 14474 completed with status 0
% 5.93/1.41 # Result found by new_bool_1
% 5.93/1.41 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.93/1.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.93/1.41 # Starting new_bool_3 with 900s (3) cores
% 5.93/1.41 # Starting new_bool_1 with 900s (3) cores
% 5.93/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.93/1.41 # Search class: FGHSM-SSLM32-MFFFFFNN
% 5.93/1.41 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 5.93/1.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 487s (1) cores
% 5.93/1.41 # Starting new_bool_1 with 91s (1) cores
% 5.93/1.41 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 82s (1) cores
% 5.93/1.41 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 14482 completed with status 0
% 5.93/1.41 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 5.93/1.41 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.93/1.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.93/1.41 # Starting new_bool_3 with 900s (3) cores
% 5.93/1.41 # Starting new_bool_1 with 900s (3) cores
% 5.93/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.93/1.41 # Search class: FGHSM-SSLM32-MFFFFFNN
% 5.93/1.41 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 5.93/1.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 487s (1) cores
% 5.93/1.41 # Starting new_bool_1 with 91s (1) cores
% 5.93/1.41 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 82s (1) cores
% 5.93/1.41 # Preprocessing time : 0.017 s
% 5.93/1.41 # Presaturation interreduction done
% 5.93/1.41
% 5.93/1.41 # Proof found!
% 5.93/1.41 # SZS status Theorem
% 5.93/1.41 # SZS output start CNFRefutation
% See solution above
% 5.93/1.41 # Parsed axioms : 4434
% 5.93/1.41 # Removed by relevancy pruning/SinE : 3811
% 5.93/1.41 # Initial clauses : 1092
% 5.93/1.41 # Removed in clause preprocessing : 32
% 5.93/1.41 # Initial clauses in saturation : 1060
% 5.93/1.41 # Processed clauses : 5624
% 5.93/1.41 # ...of these trivial : 80
% 5.93/1.41 # ...subsumed : 2907
% 5.93/1.41 # ...remaining for further processing : 2636
% 5.93/1.41 # Other redundant clauses eliminated : 183
% 5.93/1.41 # Clauses deleted for lack of memory : 0
% 5.93/1.41 # Backward-subsumed : 84
% 5.93/1.41 # Backward-rewritten : 53
% 5.93/1.41 # Generated clauses : 21677
% 5.93/1.41 # ...of the previous two non-redundant : 19201
% 5.93/1.41 # ...aggressively subsumed : 0
% 5.93/1.41 # Contextual simplify-reflections : 44
% 5.93/1.41 # Paramodulations : 21493
% 5.93/1.41 # Factorizations : 1
% 5.93/1.41 # NegExts : 0
% 5.93/1.41 # Equation resolutions : 190
% 5.93/1.41 # Disequality decompositions : 0
% 5.93/1.41 # Total rewrite steps : 6388
% 5.93/1.41 # ...of those cached : 4290
% 5.93/1.41 # Propositional unsat checks : 0
% 5.93/1.41 # Propositional check models : 0
% 5.93/1.41 # Propositional check unsatisfiable : 0
% 5.93/1.41 # Propositional clauses : 0
% 5.93/1.41 # Propositional clauses after purity: 0
% 5.93/1.41 # Propositional unsat core size : 0
% 5.93/1.41 # Propositional preprocessing time : 0.000
% 5.93/1.41 # Propositional encoding time : 0.000
% 5.93/1.41 # Propositional solver time : 0.000
% 5.93/1.41 # Success case prop preproc time : 0.000
% 5.93/1.41 # Success case prop encoding time : 0.000
% 5.93/1.41 # Success case prop solver time : 0.000
% 5.93/1.41 # Current number of processed clauses : 1432
% 5.93/1.41 # Positive orientable unit clauses : 330
% 5.93/1.41 # Positive unorientable unit clauses: 3
% 5.93/1.41 # Negative unit clauses : 383
% 5.93/1.41 # Non-unit-clauses : 716
% 5.93/1.41 # Current number of unprocessed clauses: 15560
% 5.93/1.41 # ...number of literals in the above : 32948
% 5.93/1.41 # Current number of archived formulas : 0
% 5.93/1.41 # Current number of archived clauses : 1097
% 5.93/1.41 # Clause-clause subsumption calls (NU) : 432192
% 5.93/1.41 # Rec. Clause-clause subsumption calls : 207550
% 5.93/1.41 # Non-unit clause-clause subsumptions : 583
% 5.93/1.41 # Unit Clause-clause subsumption calls : 28224
% 5.93/1.41 # Rewrite failures with RHS unbound : 0
% 5.93/1.41 # BW rewrite match attempts : 334
% 5.93/1.41 # BW rewrite match successes : 175
% 5.93/1.41 # Condensation attempts : 0
% 5.93/1.41 # Condensation successes : 0
% 5.93/1.41 # Termbank termtop insertions : 352453
% 5.93/1.41 # Search garbage collected termcells : 47978
% 5.93/1.41
% 5.93/1.41 # -------------------------------------------------
% 5.93/1.41 # User time : 0.699 s
% 5.93/1.41 # System time : 0.038 s
% 5.93/1.41 # Total time : 0.737 s
% 5.93/1.41 # Maximum resident set size: 10532 pages
% 5.93/1.41
% 5.93/1.41 # -------------------------------------------------
% 5.93/1.41 # User time : 2.153 s
% 5.93/1.41 # System time : 0.077 s
% 5.93/1.41 # Total time : 2.230 s
% 5.93/1.41 # Maximum resident set size: 7284 pages
% 5.93/1.41 % E---3.1 exiting
%------------------------------------------------------------------------------