TSTP Solution File: SEU167+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU167+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:30:42 EDT 2023
% Result : Timeout 0.29s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 12 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.a8veDVPAyc/E---3.1_2285.p',t1_xboole_1) ).
fof(t118_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.a8veDVPAyc/E---3.1_2285.p',t118_zfmisc_1) ).
fof(t119_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.a8veDVPAyc/E---3.1_2285.p',t119_zfmisc_1) ).
fof(c_0_3,plain,
! [X10,X11,X12] :
( ~ subset(X10,X11)
| ~ subset(X11,X12)
| subset(X10,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_4,plain,
! [X13,X14,X15] :
( ( subset(cartesian_product2(X13,X15),cartesian_product2(X14,X15))
| ~ subset(X13,X14) )
& ( subset(cartesian_product2(X15,X13),cartesian_product2(X15,X14))
| ~ subset(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t118_zfmisc_1])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
inference(assume_negation,[status(cth)],[t119_zfmisc_1]) ).
cnf(c_0_6,plain,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk3_0,esk4_0)
& ~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(X1,cartesian_product2(X4,X3))
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X1,X3)
| ~ subset(X2,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU167+3 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:28:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.a8veDVPAyc/E---3.1_2285.p
% 0.29/300.13 # Version: 3.1pre001
% 0.29/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.29/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.29/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.29/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.29/300.13 # Starting sh5l with 300s (1) cores
% 0.29/300.13 # new_bool_3 with pid 2363 completed with status 0
% 0.29/300.13 # Result found by new_bool_3
% 0.29/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.29/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.29/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.29/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/300.13 # Search class: FHUNF-FFSF22-SFFFFFNN
% 0.29/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.29/300.13 # SAT001_MinMin_p005000_rr_RG with pid 2366 completed with status 0
% 0.29/300.13 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.29/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.29/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.29/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.29/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/300.13 # Search class: FHUNF-FFSF22-SFFFFFNN
% 0.29/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.29/300.13 # Preprocessing time : 0.001 s
% 0.29/300.13 # Presaturation interreduction done
% 0.29/300.13
% 0.29/300.13 # Proof found!
% 0.29/300.13 # SZS status Theorem
% 0.29/300.13 # SZS output start CNFRefutation
% See solution above
% 0.29/300.13 # Parsed axioms : 6
% 0.29/300.13 # Removed by relevancy pruning/SinE : 2
% 0.29/300.13 # Initial clauses : 7
% 0.29/300.13 # Removed in clause preprocessing : 0
% 0.29/300.13 # Initial clauses in saturation : 7
% 0.29/300.13 # Processed clauses : 28
% 0.29/300.13 # ...of these trivial : 0
% 0.29/300.13 # ...subsumed : 3
% 0.29/300.13 # ...remaining for further processing : 25
% 0.29/300.13 # Other redundant clauses eliminated : 0
% 0.29/300.13 # Clauses deleted for lack of memory : 0
% 0.29/300.13 # Backward-subsumed : 0
% 0.29/300.13 # Backward-rewritten : 0
% 0.29/300.13 # Generated clauses : 36
% 0.29/300.13 # ...of the previous two non-redundant : 34
% 0.29/300.13 # ...aggressively subsumed : 0
% 0.29/300.13 # Contextual simplify-reflections : 0
% 0.29/300.13 # Paramodulations : 36
% 0.29/300.13 # Factorizations : 0
% 0.29/300.13 # NegExts : 0
% 0.29/300.13 # Equation resolutions : 0
% 0.29/300.13 # Total rewrite steps : 2
% 0.29/300.13 # Propositional unsat checks : 0
% 0.29/300.13 # Propositional check models : 0
% 0.29/300.13 # Propositional check unsatisfiable : 0
% 0.29/300.13 # Propositional clauses : 0
% 0.29/300.13 # Propositional clauses after purity: 0
% 0.29/300.13 # Propositional unsat core size : 0
% 0.29/300.13 # Propositional preprocessing time : 0.000
% 0.29/300.13 # Propositional encoding time : 0.000
% 0.29/300.13 # Propositional solver time : 0.000
% 0.29/300.13 # Success case prop preproc time : 0.000
% 0.29/300.13 # Success case prop encoding time : 0.000
% 0.29/300.13 # Success case prop solver time : 0.000
% 0.29/300.13 # Current number of processed clauses : 18
% 0.29/300.13 # Positive orientable unit clauses : 3
% 0.29/300.13 # Positive unorientable unit clauses: 0
% 0.29/300.13 # Negative unit clauses : 1
% 0.29/300.13 # Non-unit-clauses : 14
% 0.29/300.13 # Current number of unprocessed clauses: 16
% 0.29/300.13 # ...number of literals in the above : 45
% 0.29/300.13 # Current number of archived formulas : 0
% 0.29/300.13 # Current number of archived clauses : 7
% 0.29/300.13 # Clause-clause subsumption calls (NU) : 58
% 0.29/300.13 # Rec. Clause-clause subsumption calls : 58
% 0.29/300.13 # Non-unit clause-clause subsumptions : 3
% 0.29/300.13 # Unit Clause-clause subsumption calls : 0
% 0.29/300.13 # Rewrite failures with RHS unbound : 0
% 0.29/300.13 # BW rewrite match attempts : 3
% 0.29/300.13 # BW rewrite match successes : 0
% 0.29/300.13 # Condensation attempts : 0
% 0.29/300.13 # Condensation successes : 0
% 0.29/300.13 # Termbank termtop insertions : 848
% 0.29/300.13
% 0.29/300.13 # -------------------------------------------------
% 0.29/300.13 # User time : 0.003 s
% 0.29/300.13 # System time : 0.002 s
% 0.29/300.13 # Total time : 0.004 s
% 0.29/300.13 # Maximum resident set size: 1772 pages
% 0.29/300.13
% 0.29/300.13 # -------------------------------------------------
% 0.29/300.13 # User time : 0.004 s
% 0.29/300.13 # System time : 0.003 s
% 0.29/300.13 # Total time : 0.007 s
% 0.29/300.13 # Maximum resident set size: 1672 pages
% 0.29/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------