TSTP Solution File: SET985+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET985+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:21:27 EDT 2023
% Result : Timeout 408.16s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 58 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 50 ( 15 ~; 23 |; 6 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 3 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t139_zfmisc_1,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2,X3,X4] :
( ( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)) )
=> subset(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VeceDJq4sd/E---3.1_20333.p',t139_zfmisc_1) ).
fof(t138_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
=> ( cartesian_product2(X1,X2) = empty_set
| ( subset(X1,X3)
& subset(X2,X4) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VeceDJq4sd/E---3.1_20333.p',t138_zfmisc_1) ).
fof(t113_zfmisc_1,axiom,
! [X1,X2] :
( cartesian_product2(X1,X2) = empty_set
<=> ( X1 = empty_set
| X2 = empty_set ) ),
file('/export/starexec/sandbox2/tmp/tmp.VeceDJq4sd/E---3.1_20333.p',t113_zfmisc_1) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/tmp.VeceDJq4sd/E---3.1_20333.p',t2_xboole_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/tmp/tmp.VeceDJq4sd/E---3.1_20333.p',fc1_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2,X3,X4] :
( ( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)) )
=> subset(X2,X4) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t139_zfmisc_1])]) ).
fof(c_0_6,plain,
! [X10,X11,X12,X13] :
( ( subset(X10,X12)
| cartesian_product2(X10,X11) = empty_set
| ~ subset(cartesian_product2(X10,X11),cartesian_product2(X12,X13)) )
& ( subset(X11,X13)
| cartesian_product2(X10,X11) = empty_set
| ~ subset(cartesian_product2(X10,X11),cartesian_product2(X12,X13)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t138_zfmisc_1])])]) ).
fof(c_0_7,negated_conjecture,
( ~ empty(esk1_0)
& ( subset(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| subset(cartesian_product2(esk2_0,esk1_0),cartesian_product2(esk4_0,esk3_0)) )
& ~ subset(esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| cartesian_product2(X1,X3) = empty_set
| ~ subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( subset(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| subset(cartesian_product2(esk2_0,esk1_0),cartesian_product2(esk4_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ subset(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X15,X16] :
( ( cartesian_product2(X15,X16) != empty_set
| X15 = empty_set
| X16 = empty_set )
& ( X15 != empty_set
| cartesian_product2(X15,X16) = empty_set )
& ( X16 != empty_set
| cartesian_product2(X15,X16) = empty_set ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t113_zfmisc_1])])]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| cartesian_product2(X3,X1) = empty_set
| ~ subset(cartesian_product2(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( cartesian_product2(esk2_0,esk1_0) = empty_set
| subset(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,plain,
( X1 = empty_set
| X2 = empty_set
| cartesian_product2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( cartesian_product2(esk2_0,esk1_0) = empty_set
| cartesian_product2(esk1_0,esk2_0) = empty_set ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
fof(c_0_16,plain,
! [X14] : subset(empty_set,X14),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_17,negated_conjecture,
( esk2_0 = empty_set
| esk1_0 = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
cnf(c_0_18,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ empty(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.16 % Problem : SET985+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.17 % Command : run_E %s %d THM
% 0.11/0.37 % Computer : n025.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8042.1875MB
% 0.11/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.37 % CPULimit : 2400
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Oct 2 18:00:36 EDT 2023
% 0.11/0.37 % CPUTime :
% 0.16/0.48 Running first-order theorem proving
% 0.16/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.VeceDJq4sd/E---3.1_20333.p
% 408.16/300.16 # Version: 3.1pre001
% 408.16/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.16/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.16/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.16/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.16/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.16/300.16 # Starting sh5l with 300s (1) cores
% 408.16/300.16 # new_bool_1 with pid 20559 completed with status 0
% 408.16/300.16 # Result found by new_bool_1
% 408.16/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.16/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.16/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.16/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.16/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.16/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.16/300.16 # Search class: FGUSS-FFSS22-SFFFFFNN
% 408.16/300.16 # partial match(1): FGUSS-FFSF22-SFFFFFNN
% 408.16/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.16/300.16 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 408.16/300.16 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 20570 completed with status 0
% 408.16/300.16 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 408.16/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.16/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.16/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.16/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.16/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.16/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.16/300.16 # Search class: FGUSS-FFSS22-SFFFFFNN
% 408.16/300.16 # partial match(1): FGUSS-FFSF22-SFFFFFNN
% 408.16/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.16/300.16 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 408.16/300.16 # Preprocessing time : 0.001 s
% 408.16/300.16 # Presaturation interreduction done
% 408.16/300.16
% 408.16/300.16 # Proof found!
% 408.16/300.16 # SZS status Theorem
% 408.16/300.16 # SZS output start CNFRefutation
% See solution above
% 408.16/300.16 # Parsed axioms : 8
% 408.16/300.16 # Removed by relevancy pruning/SinE : 0
% 408.16/300.16 # Initial clauses : 13
% 408.16/300.16 # Removed in clause preprocessing : 0
% 408.16/300.16 # Initial clauses in saturation : 13
% 408.16/300.16 # Processed clauses : 32
% 408.16/300.16 # ...of these trivial : 0
% 408.16/300.16 # ...subsumed : 0
% 408.16/300.16 # ...remaining for further processing : 32
% 408.16/300.16 # Other redundant clauses eliminated : 2
% 408.16/300.16 # Clauses deleted for lack of memory : 0
% 408.16/300.16 # Backward-subsumed : 0
% 408.16/300.16 # Backward-rewritten : 4
% 408.16/300.16 # Generated clauses : 21
% 408.16/300.16 # ...of the previous two non-redundant : 14
% 408.16/300.16 # ...aggressively subsumed : 0
% 408.16/300.16 # Contextual simplify-reflections : 1
% 408.16/300.16 # Paramodulations : 19
% 408.16/300.16 # Factorizations : 0
% 408.16/300.16 # NegExts : 0
% 408.16/300.16 # Equation resolutions : 2
% 408.16/300.16 # Total rewrite steps : 25
% 408.16/300.16 # Propositional unsat checks : 0
% 408.16/300.16 # Propositional check models : 0
% 408.16/300.16 # Propositional check unsatisfiable : 0
% 408.16/300.16 # Propositional clauses : 0
% 408.16/300.16 # Propositional clauses after purity: 0
% 408.16/300.16 # Propositional unsat core size : 0
% 408.16/300.16 # Propositional preprocessing time : 0.000
% 408.16/300.16 # Propositional encoding time : 0.000
% 408.16/300.16 # Propositional solver time : 0.000
% 408.16/300.16 # Success case prop preproc time : 0.000
% 408.16/300.16 # Success case prop encoding time : 0.000
% 408.16/300.16 # Success case prop solver time : 0.000
% 408.16/300.16 # Current number of processed clauses : 13
% 408.16/300.16 # Positive orientable unit clauses : 7
% 408.16/300.16 # Positive unorientable unit clauses: 0
% 408.16/300.16 # Negative unit clauses : 2
% 408.16/300.16 # Non-unit-clauses : 4
% 408.16/300.16 # Current number of unprocessed clauses: 8
% 408.16/300.16 # ...number of literals in the above : 26
% 408.16/300.16 # Current number of archived formulas : 0
% 408.16/300.16 # Current number of archived clauses : 17
% 408.16/300.16 # Clause-clause subsumption calls (NU) : 6
% 408.16/300.16 # Rec. Clause-clause subsumption calls : 6
% 408.16/300.16 # Non-unit clause-clause subsumptions : 1
% 408.16/300.16 # Unit Clause-clause subsumption calls : 2
% 408.16/300.16 # Rewrite failures with RHS unbound : 0
% 408.16/300.16 # BW rewrite match attempts : 2
% 408.16/300.16 # BW rewrite match successes : 1
% 408.16/300.16 # Condensation attempts : 0
% 408.16/300.16 # Condensation successes : 0
% 408.16/300.16 # Termbank termtop insertions : 850
% 408.16/300.16
% 408.16/300.16 # -------------------------------------------------
% 408.16/300.16 # User time : 0.002 s
% 408.16/300.16 # System time : 0.003 s
% 408.16/300.16 # Total time : 0.005 s
% 408.16/300.16 # Maximum resident set size: 1768 pages
% 408.16/300.16
% 408.16/300.16 # -------------------------------------------------
% 408.16/300.16 # User time : 0.003 s
% 408.16/300.16 # System time : 0.005 s
% 408.16/300.16 # Total time : 0.008 s
% 408.16/300.16 # Maximum resident set size: 1676 pages
% 408.16/300.16 % E---3.1 exiting
% 408.16/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------