TSTP Solution File: SEU263+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU263+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:31:12 EDT 2023
% Result : Theorem 0.95s 0.60s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 9 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 103 ( 43 ~; 40 |; 8 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 112 ( 6 sgn; 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
<=> subset(X3,cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',d1_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',redefinition_m2_relset_1) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',t1_xboole_1) ).
fof(t14_relset_1,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',t14_relset_1) ).
fof(t119_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',t119_zfmisc_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',cc1_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',dt_m2_relset_1) ).
fof(t21_relat_1,axiom,
! [X1] :
( relation(X1)
=> subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',t21_relat_1) ).
fof(t12_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',t12_relset_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.om2WbKa817/E---3.1_17868.p',reflexivity_r1_tarski) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( ( ~ relation_of2(X10,X8,X9)
| subset(X10,cartesian_product2(X8,X9)) )
& ( ~ subset(X10,cartesian_product2(X8,X9))
| relation_of2(X10,X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relset_1])]) ).
fof(c_0_11,plain,
! [X22,X23,X24] :
( ( ~ relation_of2_as_subset(X24,X22,X23)
| relation_of2(X24,X22,X23) )
& ( ~ relation_of2(X24,X22,X23)
| relation_of2_as_subset(X24,X22,X23) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
fof(c_0_12,plain,
! [X37,X38,X39] :
( ~ subset(X37,X38)
| ~ subset(X38,X39)
| subset(X37,X39) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
cnf(c_0_13,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
inference(assume_negation,[status(cth)],[t14_relset_1]) ).
fof(c_0_16,plain,
! [X26,X27,X28,X29] :
( ~ subset(X26,X27)
| ~ subset(X28,X29)
| subset(cartesian_product2(X26,X28),cartesian_product2(X27,X29)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t119_zfmisc_1])]) ).
fof(c_0_17,plain,
! [X5,X6,X7] :
( ~ element(X7,powerset(cartesian_product2(X5,X6)))
| relation(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_18,plain,
! [X11,X12,X13] :
( ~ relation_of2_as_subset(X13,X11,X12)
| element(X13,powerset(cartesian_product2(X11,X12))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_19,plain,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_21,negated_conjecture,
( relation_of2_as_subset(esk7_0,esk6_0,esk4_0)
& subset(relation_rng(esk7_0),esk5_0)
& ~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,plain,
( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4))
| ~ subset(X1,X2)
| ~ subset(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X40] :
( ~ relation(X40)
| subset(X40,cartesian_product2(relation_dom(X40),relation_rng(X40))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_relat_1])]) ).
cnf(c_0_24,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( relation_of2(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X4,X2,X3)
| ~ subset(X1,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
relation_of2_as_subset(esk7_0,esk6_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(X1,cartesian_product2(X4,X5))
| ~ subset(X5,X3)
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_31,plain,
( subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_33,plain,
! [X30,X31,X32] :
( ( subset(relation_dom(X32),X30)
| ~ relation_of2_as_subset(X32,X30,X31) )
& ( subset(relation_rng(X32),X31)
| ~ relation_of2_as_subset(X32,X30,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])]) ).
cnf(c_0_34,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( subset(X1,cartesian_product2(esk6_0,esk4_0))
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(relation_rng(X1),X3)
| ~ subset(relation_dom(X1),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
subset(relation_rng(esk7_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_38,negated_conjecture,
relation(esk7_0),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_39,plain,
( subset(relation_dom(X1),X2)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( relation_of2_as_subset(X1,esk6_0,esk4_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_41,plain,
! [X25] : subset(X25,X25),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_42,negated_conjecture,
( subset(esk7_0,cartesian_product2(X1,esk5_0))
| ~ subset(relation_dom(esk7_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
( subset(relation_dom(X1),esk6_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
subset(esk7_0,cartesian_product2(esk6_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU263+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 08:59:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.om2WbKa817/E---3.1_17868.p
% 0.95/0.60 # Version: 3.1pre001
% 0.95/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.95/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.95/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.60 # Starting sh5l with 300s (1) cores
% 0.95/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17985 completed with status 0
% 0.95/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.95/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.95/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.95/0.60 # No SInE strategy applied
% 0.95/0.60 # Search class: FHUNM-FFSF21-SFFFFFNN
% 0.95/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.95/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.95/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.95/0.60 # Starting new_bool_3 with 136s (1) cores
% 0.95/0.60 # Starting new_bool_1 with 136s (1) cores
% 0.95/0.60 # Starting sh5l with 136s (1) cores
% 0.95/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17991 completed with status 0
% 0.95/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.95/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.95/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.95/0.60 # No SInE strategy applied
% 0.95/0.60 # Search class: FHUNM-FFSF21-SFFFFFNN
% 0.95/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.95/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.95/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.95/0.60 # Preprocessing time : 0.001 s
% 0.95/0.60 # Presaturation interreduction done
% 0.95/0.60
% 0.95/0.60 # Proof found!
% 0.95/0.60 # SZS status Theorem
% 0.95/0.60 # SZS output start CNFRefutation
% See solution above
% 0.95/0.60 # Parsed axioms : 20
% 0.95/0.60 # Removed by relevancy pruning/SinE : 0
% 0.95/0.60 # Initial clauses : 26
% 0.95/0.60 # Removed in clause preprocessing : 6
% 0.95/0.60 # Initial clauses in saturation : 20
% 0.95/0.60 # Processed clauses : 628
% 0.95/0.60 # ...of these trivial : 14
% 0.95/0.60 # ...subsumed : 108
% 0.95/0.60 # ...remaining for further processing : 506
% 0.95/0.60 # Other redundant clauses eliminated : 0
% 0.95/0.60 # Clauses deleted for lack of memory : 0
% 0.95/0.60 # Backward-subsumed : 7
% 0.95/0.60 # Backward-rewritten : 0
% 0.95/0.60 # Generated clauses : 3981
% 0.95/0.60 # ...of the previous two non-redundant : 3830
% 0.95/0.60 # ...aggressively subsumed : 0
% 0.95/0.60 # Contextual simplify-reflections : 3
% 0.95/0.60 # Paramodulations : 3981
% 0.95/0.60 # Factorizations : 0
% 0.95/0.60 # NegExts : 0
% 0.95/0.60 # Equation resolutions : 0
% 0.95/0.60 # Total rewrite steps : 321
% 0.95/0.60 # Propositional unsat checks : 0
% 0.95/0.60 # Propositional check models : 0
% 0.95/0.60 # Propositional check unsatisfiable : 0
% 0.95/0.60 # Propositional clauses : 0
% 0.95/0.60 # Propositional clauses after purity: 0
% 0.95/0.60 # Propositional unsat core size : 0
% 0.95/0.60 # Propositional preprocessing time : 0.000
% 0.95/0.60 # Propositional encoding time : 0.000
% 0.95/0.60 # Propositional solver time : 0.000
% 0.95/0.60 # Success case prop preproc time : 0.000
% 0.95/0.60 # Success case prop encoding time : 0.000
% 0.95/0.60 # Success case prop solver time : 0.000
% 0.95/0.60 # Current number of processed clauses : 479
% 0.95/0.60 # Positive orientable unit clauses : 133
% 0.95/0.60 # Positive unorientable unit clauses: 0
% 0.95/0.60 # Negative unit clauses : 2
% 0.95/0.60 # Non-unit-clauses : 344
% 0.95/0.60 # Current number of unprocessed clauses: 3232
% 0.95/0.60 # ...number of literals in the above : 4975
% 0.95/0.60 # Current number of archived formulas : 0
% 0.95/0.60 # Current number of archived clauses : 27
% 0.95/0.60 # Clause-clause subsumption calls (NU) : 24385
% 0.95/0.60 # Rec. Clause-clause subsumption calls : 21221
% 0.95/0.60 # Non-unit clause-clause subsumptions : 118
% 0.95/0.60 # Unit Clause-clause subsumption calls : 265
% 0.95/0.60 # Rewrite failures with RHS unbound : 0
% 0.95/0.60 # BW rewrite match attempts : 233
% 0.95/0.60 # BW rewrite match successes : 0
% 0.95/0.60 # Condensation attempts : 0
% 0.95/0.60 # Condensation successes : 0
% 0.95/0.60 # Termbank termtop insertions : 54265
% 0.95/0.60
% 0.95/0.60 # -------------------------------------------------
% 0.95/0.60 # User time : 0.079 s
% 0.95/0.60 # System time : 0.008 s
% 0.95/0.60 # Total time : 0.087 s
% 0.95/0.60 # Maximum resident set size: 1744 pages
% 0.95/0.60
% 0.95/0.60 # -------------------------------------------------
% 0.95/0.60 # User time : 0.458 s
% 0.95/0.60 # System time : 0.022 s
% 0.95/0.60 # Total time : 0.480 s
% 0.95/0.60 # Maximum resident set size: 1688 pages
% 0.95/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------