TSTP Solution File: SET962+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET962+1 : TPTP v8.2.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 02:56:40 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 65 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 66 ( 25 ~; 31 |; 5 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 7 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t115_zfmisc_1,conjecture,
! [X1,X2] :
( cartesian_product2(X1,X1) = cartesian_product2(X2,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t115_zfmisc_1) ).
fof(l55_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( cartesian_product2(X1,X1) = cartesian_product2(X2,X2)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t115_zfmisc_1]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10] :
( ( in(X7,X9)
| ~ in(ordered_pair(X7,X8),cartesian_product2(X9,X10)) )
& ( in(X8,X10)
| ~ in(ordered_pair(X7,X8),cartesian_product2(X9,X10)) )
& ( ~ in(X7,X9)
| ~ in(X8,X10)
| in(ordered_pair(X7,X8),cartesian_product2(X9,X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])])]) ).
fof(c_0_5,negated_conjecture,
( cartesian_product2(esk1_0,esk1_0) = cartesian_product2(esk2_0,esk2_0)
& esk1_0 != esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
cartesian_product2(esk1_0,esk1_0) = cartesian_product2(esk2_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(X1,esk1_0)
| ~ in(ordered_pair(X2,X1),cartesian_product2(esk2_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X13,X14] :
( ( ~ in(esk3_2(X13,X14),X13)
| ~ in(esk3_2(X13,X14),X14)
| X13 = X14 )
& ( in(esk3_2(X13,X14),X13)
| in(esk3_2(X13,X14),X14)
| X13 = X14 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])])]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0)
| ~ in(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( in(esk3_2(X1,X2),X1)
| in(esk3_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( esk2_0 = X1
| in(esk3_2(esk2_0,X1),X1)
| in(X2,esk1_0)
| ~ in(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( in(ordered_pair(X1,X2),cartesian_product2(esk2_0,esk2_0))
| ~ in(X2,esk1_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( esk2_0 = X1
| esk2_0 = X2
| in(esk3_2(esk2_0,X1),esk1_0)
| in(esk3_2(esk2_0,X1),X1)
| in(esk3_2(esk2_0,X2),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X2,esk1_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
in(esk3_2(esk2_0,esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ in(esk3_2(X1,X2),X1)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ in(esk3_2(esk2_0,esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_17]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET962+1 : TPTP v8.2.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 11:15:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 29530 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 29536 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 9
% 0.20/0.49 # Removed by relevancy pruning/SinE : 2
% 0.20/0.49 # Initial clauses : 11
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 11
% 0.20/0.49 # Processed clauses : 43
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 3
% 0.20/0.49 # ...remaining for further processing : 40
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 3
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 58
% 0.20/0.49 # ...of the previous two non-redundant : 49
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 50
% 0.20/0.49 # Factorizations : 8
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 26
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 5
% 0.20/0.49 # Non-unit-clauses : 18
% 0.20/0.49 # Current number of unprocessed clauses: 25
% 0.20/0.49 # ...number of literals in the above : 116
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 14
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 111
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 84
% 0.20/0.49 # Non-unit clause-clause subsumptions : 6
% 0.20/0.49 # Unit Clause-clause subsumption calls : 9
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1500
% 0.20/0.49 # Search garbage collected termcells : 152
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1736 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 1696 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------