TSTP Solution File: SWV370+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV370+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 19:57:05 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 96 ( 17 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 92 ( 34 ~; 41 |; 8 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 98 ( 15 sgn; 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l6_co,conjecture,
! [X1] :
( ! [X2,X3,X4] :
( contains_cpq(triple(X2,X1,X3),X4)
<=> contains_pq(i(triple(X2,X1,X3)),X4) )
=> ! [X5,X6,X7,X8,X9] :
( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
<=> contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3GaQb2mXLy/E---3.1_31319.p',l6_co) ).
fof(ax55,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/tmp/tmp.3GaQb2mXLy/E---3.1_31319.p',ax55) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.3GaQb2mXLy/E---3.1_31319.p',ax39) ).
fof(ax9,axiom,
! [X1,X2,X3] :
( contains_pq(insert_pq(X1,X2),X3)
<=> ( contains_pq(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.3GaQb2mXLy/E---3.1_31319.p',ax9) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.3GaQb2mXLy/E---3.1_31319.p',ax21) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4] :
( contains_cpq(triple(X2,X1,X3),X4)
<=> contains_pq(i(triple(X2,X1,X3)),X4) )
=> ! [X5,X6,X7,X8,X9] :
( contains_cpq(triple(X5,insert_slb(X1,pair(X7,X8)),X6),X9)
<=> contains_pq(i(triple(X5,insert_slb(X1,pair(X7,X8)),X6)),X9) ) ),
inference(assume_negation,[status(cth)],[l6_co]) ).
fof(c_0_6,negated_conjecture,
! [X11,X12,X13] :
( ( ~ contains_cpq(triple(X11,esk1_0,X12),X13)
| contains_pq(i(triple(X11,esk1_0,X12)),X13) )
& ( ~ contains_pq(i(triple(X11,esk1_0,X12)),X13)
| contains_cpq(triple(X11,esk1_0,X12),X13) )
& ( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) )
& ( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) ) ),
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_7,plain,
! [X19,X20,X21,X22,X23] : i(triple(X19,insert_slb(X20,pair(X22,X23)),X21)) = insert_pq(i(triple(X19,X20,X21)),X22),
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_8,plain,
! [X28,X29,X30,X31] :
( ( ~ contains_cpq(triple(X28,X29,X30),X31)
| contains_slb(X29,X31) )
& ( ~ contains_slb(X29,X31)
| contains_cpq(triple(X28,X29,X30),X31) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])]) ).
cnf(c_0_9,negated_conjecture,
( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| ~ contains_pq(i(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X32,X33,X34] :
( ( ~ contains_pq(insert_pq(X32,X33),X34)
| contains_pq(X32,X34)
| X33 = X34 )
& ( ~ contains_pq(X32,X34)
| contains_pq(insert_pq(X32,X33),X34) )
& ( X33 != X34
| contains_pq(insert_pq(X32,X33),X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9])])]) ).
cnf(c_0_13,plain,
( contains_slb(X2,X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ contains_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),esk6_0)
| ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,plain,
( contains_cpq(triple(X3,X1,X4),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X24,X25,X26,X27] :
( ( ~ contains_slb(insert_slb(X24,pair(X25,X27)),X26)
| contains_slb(X24,X26)
| X25 = X26 )
& ( ~ contains_slb(X24,X26)
| contains_slb(insert_slb(X24,pair(X25,X27)),X26) )
& ( X25 != X26
| contains_slb(insert_slb(X24,pair(X25,X27)),X26) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_18,plain,
( contains_pq(X1,X3)
| X2 = X3
| ~ contains_pq(insert_pq(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| ~ contains_pq(insert_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( contains_pq(insert_pq(X1,X3),X2)
| ~ contains_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( contains_slb(X1,X4)
| X2 = X4
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk6_0)
| ~ contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( contains_slb(insert_slb(X1,pair(X3,X4)),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( contains_cpq(triple(X1,esk1_0,X2),X3)
| ~ contains_pq(i(triple(X1,esk1_0,X2)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(esk1_0,esk6_0)
| contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ contains_slb(esk1_0,esk6_0)
| ~ contains_pq(i(triple(esk2_0,esk1_0,esk3_0)),esk6_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( contains_pq(i(triple(X1,esk1_0,X2)),X3)
| ~ contains_cpq(triple(X1,esk1_0,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( esk6_0 = esk4_0
| contains_cpq(triple(esk2_0,esk1_0,esk3_0),esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]) ).
cnf(c_0_31,negated_conjecture,
~ contains_cpq(triple(esk2_0,esk1_0,esk3_0),esk6_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]) ).
cnf(c_0_32,plain,
( contains_slb(insert_slb(X3,pair(X1,X4)),X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,plain,
( contains_pq(insert_pq(X3,X1),X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
esk6_0 = esk4_0,
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
contains_slb(insert_slb(X1,pair(X2,X3)),X2),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
contains_pq(insert_pq(X1,X2),X2),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_34]),c_0_35]),c_0_34]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWV370+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n016.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 : Tue Oct 3 04:02:07 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.3GaQb2mXLy/E---3.1_31319.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 31397 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSS-FFSF32-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # SAT001_MinMin_p005000_rr_RG with pid 31401 completed with status 0
% 0.15/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSS-FFSF32-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.002 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 63
% 0.15/0.43 # Removed by relevancy pruning/SinE : 56
% 0.15/0.43 # Initial clauses : 15
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 15
% 0.15/0.43 # Processed clauses : 44
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 0
% 0.15/0.43 # ...remaining for further processing : 44
% 0.15/0.43 # Other redundant clauses eliminated : 2
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 1
% 0.15/0.43 # Backward-rewritten : 10
% 0.15/0.43 # Generated clauses : 32
% 0.15/0.43 # ...of the previous two non-redundant : 28
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 2
% 0.15/0.43 # Paramodulations : 28
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 2
% 0.15/0.43 # Total rewrite steps : 8
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 14
% 0.15/0.43 # Positive orientable unit clauses : 4
% 0.15/0.43 # Positive unorientable unit clauses: 1
% 0.15/0.43 # Negative unit clauses : 1
% 0.15/0.43 # Non-unit-clauses : 8
% 0.15/0.43 # Current number of unprocessed clauses: 12
% 0.15/0.43 # ...number of literals in the above : 20
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 28
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 62
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 59
% 0.15/0.43 # Non-unit clause-clause subsumptions : 2
% 0.15/0.43 # Unit Clause-clause subsumption calls : 7
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 3
% 0.15/0.43 # BW rewrite match successes : 2
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 1966
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.006 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.007 s
% 0.15/0.43 # Maximum resident set size: 1900 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.008 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 1752 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------