TSTP Solution File: SWC373+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC373+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:29:20 EDT 2024
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 119 ( 19 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 148 ( 60 ~; 56 |; 15 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| segmentP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(c_0_6,plain,
! [X11,X12,X15,X16] :
( ( ssList(esk5_2(X11,X12))
| ~ segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( ssList(esk6_2(X11,X12))
| ~ segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( app(app(esk5_2(X11,X12),X12),esk6_2(X11,X12)) = X11
| ~ segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| app(app(X15,X12),X16) != X11
| segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_7,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X63] :
( ~ ssList(X63)
| app(X63,nil) = X63 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_9,plain,
! [X44,X45] :
( ~ ssList(X44)
| ~ ssList(X45)
| ssList(app(X44,X45)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| segmentP(X2,X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_11,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X29,X30,X32] :
( ( ssList(esk7_2(X29,X30))
| ~ rearsegP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( app(esk7_2(X29,X30),X30) = X29
| ~ rearsegP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( ~ ssList(X32)
| app(X32,X30) != X29
| rearsegP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) ) ),
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)],[ax6])])])])])]) ).
fof(c_0_16,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& rearsegP(esk4_0,esk3_0)
& ~ segmentP(esk2_0,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_17,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ssList(esk7_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
rearsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
rearsegP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC373+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:43:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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.22/0.55 # Version: 3.1.0
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # new_bool_3 with pid 22808 completed with status 0
% 0.22/0.55 # Result found by new_bool_3
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22811 completed with status 0
% 0.22/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.55 # Preprocessing time : 0.002 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Theorem
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 96
% 0.22/0.55 # Removed by relevancy pruning/SinE : 65
% 0.22/0.55 # Initial clauses : 52
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 52
% 0.22/0.55 # Processed clauses : 312
% 0.22/0.55 # ...of these trivial : 2
% 0.22/0.55 # ...subsumed : 73
% 0.22/0.55 # ...remaining for further processing : 237
% 0.22/0.55 # Other redundant clauses eliminated : 18
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 5
% 0.22/0.55 # Backward-rewritten : 1
% 0.22/0.55 # Generated clauses : 1015
% 0.22/0.55 # ...of the previous two non-redundant : 938
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 59
% 0.22/0.55 # Paramodulations : 994
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 22
% 0.22/0.55 # Disequality decompositions : 0
% 0.22/0.55 # Total rewrite steps : 199
% 0.22/0.55 # ...of those cached : 189
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 176
% 0.22/0.55 # Positive orientable unit clauses : 12
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 2
% 0.22/0.55 # Non-unit-clauses : 162
% 0.22/0.55 # Current number of unprocessed clauses: 728
% 0.22/0.55 # ...number of literals in the above : 3096
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 56
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 3436
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 1871
% 0.22/0.55 # Non-unit clause-clause subsumptions : 137
% 0.22/0.55 # Unit Clause-clause subsumption calls : 5
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 1
% 0.22/0.55 # BW rewrite match successes : 1
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 23377
% 0.22/0.55 # Search garbage collected termcells : 1545
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.031 s
% 0.22/0.55 # System time : 0.006 s
% 0.22/0.55 # Total time : 0.037 s
% 0.22/0.55 # Maximum resident set size: 1912 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.035 s
% 0.22/0.55 # System time : 0.008 s
% 0.22/0.55 # Total time : 0.043 s
% 0.22/0.55 # Maximum resident set size: 1816 pages
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------