TSTP Solution File: SET643+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET643+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:23:13 EDT 2023
% Result : Timeout 0.30s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 36 ( 14 ~; 11 |; 2 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 1 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_relset_1_5,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ilf_type(cross_product(X1,X2),relation_type(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bPLIUFOwED/E---3.1_13427.p',prove_relset_1_5) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,cross_product(X2,X3))
=> ilf_type(X1,relation_type(X2,X3)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bPLIUFOwED/E---3.1_13427.p',p1) ).
fof(p19,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox2/tmp/tmp.bPLIUFOwED/E---3.1_13427.p',p19) ).
fof(p10,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> subset(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bPLIUFOwED/E---3.1_13427.p',p10) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ilf_type(cross_product(X1,X2),relation_type(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_5]) ).
fof(c_0_5,plain,
! [X9,X10,X11] :
( ~ ilf_type(X9,set_type)
| ~ ilf_type(X10,set_type)
| ~ ilf_type(X11,set_type)
| ~ subset(X9,cross_product(X10,X11))
| ilf_type(X9,relation_type(X10,X11)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
fof(c_0_6,plain,
! [X8] : ilf_type(X8,set_type),
inference(variable_rename,[status(thm)],[p19]) ).
fof(c_0_7,plain,
! [X25] :
( ~ ilf_type(X25,set_type)
| subset(X25,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p10])]) ).
fof(c_0_8,negated_conjecture,
( ilf_type(esk1_0,set_type)
& ilf_type(esk2_0,set_type)
& ~ ilf_type(cross_product(esk1_0,esk2_0),relation_type(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_9,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ subset(X1,cross_product(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(X1,X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ ilf_type(cross_product(esk1_0,esk2_0),relation_type(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ subset(X1,cross_product(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_14,plain,
subset(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET643+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n018.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 16:56:54 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 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.bPLIUFOwED/E---3.1_13427.p
% 0.30/300.10 # Version: 3.1pre001
% 0.30/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.30/300.10 # Starting sh5l with 300s (1) cores
% 0.30/300.10 # new_bool_3 with pid 13506 completed with status 0
% 0.30/300.10 # Result found by new_bool_3
% 0.30/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.10 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.30/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.10 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 181s (1) cores
% 0.30/300.10 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 13510 completed with status 0
% 0.30/300.10 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.30/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.10 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.30/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.10 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 181s (1) cores
% 0.30/300.10 # Preprocessing time : 0.001 s
% 0.30/300.10 # Presaturation interreduction done
% 0.30/300.10
% 0.30/300.10 # Proof found!
% 0.30/300.10 # SZS status Theorem
% 0.30/300.10 # SZS output start CNFRefutation
% See solution above
% 0.30/300.10 # Parsed axioms : 20
% 0.30/300.10 # Removed by relevancy pruning/SinE : 2
% 0.30/300.10 # Initial clauses : 37
% 0.30/300.10 # Removed in clause preprocessing : 0
% 0.30/300.10 # Initial clauses in saturation : 37
% 0.30/300.10 # Processed clauses : 68
% 0.30/300.10 # ...of these trivial : 8
% 0.30/300.10 # ...subsumed : 2
% 0.30/300.10 # ...remaining for further processing : 58
% 0.30/300.10 # Other redundant clauses eliminated : 0
% 0.30/300.10 # Clauses deleted for lack of memory : 0
% 0.30/300.10 # Backward-subsumed : 0
% 0.30/300.10 # Backward-rewritten : 2
% 0.30/300.10 # Generated clauses : 17
% 0.30/300.10 # ...of the previous two non-redundant : 14
% 0.30/300.10 # ...aggressively subsumed : 0
% 0.30/300.10 # Contextual simplify-reflections : 1
% 0.30/300.10 # Paramodulations : 17
% 0.30/300.10 # Factorizations : 0
% 0.30/300.10 # NegExts : 0
% 0.30/300.10 # Equation resolutions : 0
% 0.30/300.10 # Total rewrite steps : 71
% 0.30/300.10 # Propositional unsat checks : 0
% 0.30/300.10 # Propositional check models : 0
% 0.30/300.10 # Propositional check unsatisfiable : 0
% 0.30/300.10 # Propositional clauses : 0
% 0.30/300.10 # Propositional clauses after purity: 0
% 0.30/300.10 # Propositional unsat core size : 0
% 0.30/300.10 # Propositional preprocessing time : 0.000
% 0.30/300.10 # Propositional encoding time : 0.000
% 0.30/300.10 # Propositional solver time : 0.000
% 0.30/300.10 # Success case prop preproc time : 0.000
% 0.30/300.10 # Success case prop encoding time : 0.000
% 0.30/300.10 # Success case prop solver time : 0.000
% 0.30/300.10 # Current number of processed clauses : 29
% 0.30/300.10 # Positive orientable unit clauses : 10
% 0.30/300.10 # Positive unorientable unit clauses: 0
% 0.30/300.10 # Negative unit clauses : 2
% 0.30/300.10 # Non-unit-clauses : 17
% 0.30/300.10 # Current number of unprocessed clauses: 10
% 0.30/300.10 # ...number of literals in the above : 22
% 0.30/300.10 # Current number of archived formulas : 0
% 0.30/300.10 # Current number of archived clauses : 29
% 0.30/300.10 # Clause-clause subsumption calls (NU) : 44
% 0.30/300.10 # Rec. Clause-clause subsumption calls : 37
% 0.30/300.10 # Non-unit clause-clause subsumptions : 1
% 0.30/300.10 # Unit Clause-clause subsumption calls : 5
% 0.30/300.10 # Rewrite failures with RHS unbound : 0
% 0.30/300.10 # BW rewrite match attempts : 2
% 0.30/300.10 # BW rewrite match successes : 2
% 0.30/300.10 # Condensation attempts : 0
% 0.30/300.10 # Condensation successes : 0
% 0.30/300.10 # Termbank termtop insertions : 3344
% 0.30/300.10
% 0.30/300.10 # -------------------------------------------------
% 0.30/300.10 # User time : 0.008 s
% 0.30/300.10 # System time : 0.001 s
% 0.30/300.10 # Total time : 0.009 s
% 0.30/300.10 # Maximum resident set size: 1816 pages
% 0.30/300.10
% 0.30/300.10 # -------------------------------------------------
% 0.30/300.10 # User time : 0.010 s
% 0.30/300.10 # System time : 0.002 s
% 0.30/300.10 # Total time : 0.012 s
% 0.30/300.10 # Maximum resident set size: 1700 pages
% 0.30/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------