TSTP Solution File: SWC101+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC101+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 04:27:37 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 140 ( 47 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 171 ( 63 ~; 57 |; 30 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 28 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,plain,
! [X17,X18,X20] :
( ( ssList(esk6_2(X17,X18))
| ~ frontsegP(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) )
& ( app(X18,esk6_2(X17,X18)) = X17
| ~ frontsegP(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) )
& ( ~ ssList(X20)
| app(X18,X20) != X17
| frontsegP(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])]) ).
fof(c_0_7,plain,
! [X45,X46] :
( ~ ssList(X45)
| ~ ssList(X46)
| ssList(app(X45,X46)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_8,negated_conjecture,
! [X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X14)
| ~ ssList(X15)
| app(cons(X14,nil),X15) != esk5_0
| ~ ssList(X16)
| app(X16,cons(X14,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 )
& ( nil != esk2_0
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ frontsegP(esk2_0,esk1_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_9,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_10,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X38,X39] :
( ( ~ neq(X38,X39)
| X38 != X39
| ~ ssList(X39)
| ~ ssList(X38) )
& ( X38 = X39
| neq(X38,X39)
| ~ ssList(X39)
| ~ ssList(X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_15,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ frontsegP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_19,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13]),c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( ~ frontsegP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_16]),c_0_13]) ).
cnf(c_0_27,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_28,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC101+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:23:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/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/benchmark/theBenchmark.p
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 13558 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13560 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 96
% 0.19/0.50 # Removed by relevancy pruning/SinE : 66
% 0.19/0.50 # Initial clauses : 62
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 62
% 0.19/0.50 # Processed clauses : 216
% 0.19/0.50 # ...of these trivial : 2
% 0.19/0.50 # ...subsumed : 15
% 0.19/0.50 # ...remaining for further processing : 199
% 0.19/0.50 # Other redundant clauses eliminated : 18
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 7
% 0.19/0.50 # Backward-rewritten : 3
% 0.19/0.50 # Generated clauses : 445
% 0.19/0.50 # ...of the previous two non-redundant : 386
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 2
% 0.19/0.50 # Paramodulations : 424
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 22
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 226
% 0.19/0.50 # ...of those cached : 208
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 123
% 0.19/0.50 # Positive orientable unit clauses : 31
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 8
% 0.19/0.50 # Non-unit-clauses : 84
% 0.19/0.50 # Current number of unprocessed clauses: 272
% 0.19/0.50 # ...number of literals in the above : 1106
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 69
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 1251
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 411
% 0.19/0.50 # Non-unit clause-clause subsumptions : 13
% 0.19/0.50 # Unit Clause-clause subsumption calls : 404
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 3
% 0.19/0.50 # BW rewrite match successes : 3
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 12089
% 0.19/0.50 # Search garbage collected termcells : 1814
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.016 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.019 s
% 0.19/0.50 # Maximum resident set size: 2040 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.017 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.022 s
% 0.19/0.50 # Maximum resident set size: 1824 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------