TSTP Solution File: SET974+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET974+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:42 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 53 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 29 ~; 17 |; 13 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-5 aty)
% Number of variables : 66 ( 11 sgn 31 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(t104_zfmisc_1,axiom,
! [X1,X2,X3,X4,X5] :
~ ( in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
& ! [X6,X7] :
~ ( X1 = ordered_pair(X6,X7)
& in(X6,set_intersection2(X2,X4))
& in(X7,set_intersection2(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(t127_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( disjoint(X1,X2)
| disjoint(X3,X4) )
=> disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t127_zfmisc_1) ).
fof(c_0_3,plain,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_4,plain,
! [X14,X15,X17,X18,X19] :
( ( disjoint(X14,X15)
| in(esk5_2(X14,X15),set_intersection2(X14,X15)) )
& ( ~ in(X19,set_intersection2(X17,X18))
| ~ disjoint(X17,X18) ) ),
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_3])])])])])]) ).
fof(c_0_5,plain,
! [X20,X21,X22,X23,X24] :
( ( X20 = ordered_pair(esk6_5(X20,X21,X22,X23,X24),esk7_5(X20,X21,X22,X23,X24))
| ~ in(X20,set_intersection2(cartesian_product2(X21,X22),cartesian_product2(X23,X24))) )
& ( in(esk6_5(X20,X21,X22,X23,X24),set_intersection2(X21,X23))
| ~ in(X20,set_intersection2(cartesian_product2(X21,X22),cartesian_product2(X23,X24))) )
& ( in(esk7_5(X20,X21,X22,X23,X24),set_intersection2(X22,X24))
| ~ in(X20,set_intersection2(cartesian_product2(X21,X22),cartesian_product2(X23,X24))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t104_zfmisc_1])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( disjoint(X1,X2)
| disjoint(X3,X4) )
=> disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
inference(assume_negation,[status(cth)],[t127_zfmisc_1]) ).
cnf(c_0_7,plain,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(esk6_5(X1,X2,X3,X4,X5),set_intersection2(X2,X4))
| ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
( ( disjoint(esk1_0,esk2_0)
| disjoint(esk3_0,esk4_0) )
& ~ disjoint(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X5))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( in(esk7_5(X1,X2,X3,X4,X5),set_intersection2(X3,X5))
| ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ disjoint(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X1,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(cartesian_product2(X4,X1),cartesian_product2(X5,X2))) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( disjoint(esk1_0,esk2_0)
| disjoint(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
~ disjoint(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X2,X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
disjoint(esk3_0,esk4_0),
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET974+1 : TPTP v8.2.0. Released v3.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.28 % CPULimit : 300
% 0.13/0.28 % WCLimit : 300
% 0.13/0.28 % DateTime : Mon May 20 12:27:37 EDT 2024
% 0.13/0.29 % CPUTime :
% 0.13/0.37 Running first-order theorem proving
% 0.13/0.37 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.13/0.38 # Version: 3.1.0
% 0.13/0.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.38 # Starting sh5l with 300s (1) cores
% 0.13/0.38 # new_bool_3 with pid 15857 completed with status 0
% 0.13/0.38 # Result found by new_bool_3
% 0.13/0.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38 # Search class: FGHSS-FFSF33-SFFFFFNN
% 0.13/0.38 # partial match(1): FGHSS-FFSF32-SFFFFFNN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.38 # SAT001_MinMin_p005000_rr_RG with pid 15863 completed with status 0
% 0.13/0.38 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38 # Search class: FGHSS-FFSF33-SFFFFFNN
% 0.13/0.38 # partial match(1): FGHSS-FFSF32-SFFFFFNN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.38 # Preprocessing time : 0.001 s
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38
% 0.13/0.38 # Proof found!
% 0.13/0.38 # SZS status Theorem
% 0.13/0.38 # SZS output start CNFRefutation
% See solution above
% 0.13/0.38 # Parsed axioms : 12
% 0.13/0.38 # Removed by relevancy pruning/SinE : 2
% 0.13/0.38 # Initial clauses : 14
% 0.13/0.38 # Removed in clause preprocessing : 0
% 0.13/0.38 # Initial clauses in saturation : 14
% 0.13/0.38 # Processed clauses : 82
% 0.13/0.38 # ...of these trivial : 1
% 0.13/0.38 # ...subsumed : 29
% 0.13/0.38 # ...remaining for further processing : 52
% 0.13/0.38 # Other redundant clauses eliminated : 0
% 0.13/0.38 # Clauses deleted for lack of memory : 0
% 0.13/0.38 # Backward-subsumed : 0
% 0.13/0.38 # Backward-rewritten : 0
% 0.13/0.38 # Generated clauses : 108
% 0.13/0.38 # ...of the previous two non-redundant : 98
% 0.13/0.38 # ...aggressively subsumed : 0
% 0.13/0.38 # Contextual simplify-reflections : 0
% 0.13/0.38 # Paramodulations : 106
% 0.13/0.38 # Factorizations : 0
% 0.13/0.38 # NegExts : 0
% 0.13/0.38 # Equation resolutions : 0
% 0.13/0.38 # Disequality decompositions : 0
% 0.13/0.38 # Total rewrite steps : 5
% 0.13/0.38 # ...of those cached : 2
% 0.13/0.38 # Propositional unsat checks : 0
% 0.13/0.38 # Propositional check models : 0
% 0.13/0.38 # Propositional check unsatisfiable : 0
% 0.13/0.38 # Propositional clauses : 0
% 0.13/0.38 # Propositional clauses after purity: 0
% 0.13/0.38 # Propositional unsat core size : 0
% 0.13/0.38 # Propositional preprocessing time : 0.000
% 0.13/0.38 # Propositional encoding time : 0.000
% 0.13/0.38 # Propositional solver time : 0.000
% 0.13/0.38 # Success case prop preproc time : 0.000
% 0.13/0.38 # Success case prop encoding time : 0.000
% 0.13/0.38 # Success case prop solver time : 0.000
% 0.13/0.38 # Current number of processed clauses : 36
% 0.13/0.38 # Positive orientable unit clauses : 4
% 0.13/0.38 # Positive unorientable unit clauses: 1
% 0.13/0.38 # Negative unit clauses : 5
% 0.13/0.38 # Non-unit-clauses : 26
% 0.13/0.38 # Current number of unprocessed clauses: 42
% 0.13/0.38 # ...number of literals in the above : 84
% 0.13/0.38 # Current number of archived formulas : 0
% 0.13/0.38 # Current number of archived clauses : 16
% 0.13/0.38 # Clause-clause subsumption calls (NU) : 170
% 0.13/0.38 # Rec. Clause-clause subsumption calls : 163
% 0.13/0.38 # Non-unit clause-clause subsumptions : 29
% 0.13/0.38 # Unit Clause-clause subsumption calls : 42
% 0.13/0.38 # Rewrite failures with RHS unbound : 0
% 0.13/0.38 # BW rewrite match attempts : 8
% 0.13/0.38 # BW rewrite match successes : 8
% 0.13/0.38 # Condensation attempts : 0
% 0.13/0.38 # Condensation successes : 0
% 0.13/0.38 # Termbank termtop insertions : 1821
% 0.13/0.38 # Search garbage collected termcells : 184
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.004 s
% 0.13/0.38 # System time : 0.001 s
% 0.13/0.38 # Total time : 0.005 s
% 0.13/0.38 # Maximum resident set size: 1768 pages
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.006 s
% 0.13/0.38 # System time : 0.001 s
% 0.13/0.38 # Total time : 0.007 s
% 0.13/0.38 # Maximum resident set size: 1696 pages
% 0.13/0.38 % E---3.1 exiting
% 0.13/0.38 % E exiting
%------------------------------------------------------------------------------