TSTP Solution File: SEU134+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:29 EDT 2023
% Result : Timeout 408.19s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 25 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 23 ( 10 ~; 8 |; 2 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t37_xboole_1,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.vo3npUIjfs/E---3.1_12831.p',t37_xboole_1) ).
fof(l32_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.vo3npUIjfs/E---3.1_12831.p',l32_xboole_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[t37_xboole_1]) ).
fof(c_0_3,negated_conjecture,
( ( set_difference(esk1_0,esk2_0) != empty_set
| ~ subset(esk1_0,esk2_0) )
& ( set_difference(esk1_0,esk2_0) = empty_set
| subset(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X6,X7] :
( ( set_difference(X6,X7) != empty_set
| subset(X6,X7) )
& ( ~ subset(X6,X7)
| set_difference(X6,X7) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])]) ).
cnf(c_0_5,negated_conjecture,
( set_difference(esk1_0,esk2_0) != empty_set
| ~ subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( set_difference(esk1_0,esk2_0) = empty_set
| subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
set_difference(esk1_0,esk2_0) != empty_set,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,esk2_0),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 09:24:40 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/0.42 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.vo3npUIjfs/E---3.1_12831.p
% 408.19/300.16 # Version: 3.1pre001
% 408.19/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.16 # Starting sh5l with 300s (1) cores
% 408.19/300.16 # new_bool_1 with pid 12959 completed with status 0
% 408.19/300.16 # Result found by new_bool_1
% 408.19/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.19/300.16 # Search class: FGHSS-FFSS22-SFFFFFNN
% 408.19/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/300.16 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.19/300.16 # SAT001_MinMin_p005000_rr_RG with pid 12962 completed with status 0
% 408.19/300.16 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.19/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.19/300.16 # Search class: FGHSS-FFSS22-SFFFFFNN
% 408.19/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/300.16 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.19/300.16 # Preprocessing time : 0.001 s
% 408.19/300.16 # Presaturation interreduction done
% 408.19/300.16
% 408.19/300.16 # Proof found!
% 408.19/300.16 # SZS status Theorem
% 408.19/300.16 # SZS output start CNFRefutation
% See solution above
% 408.19/300.16 # Parsed axioms : 14
% 408.19/300.16 # Removed by relevancy pruning/SinE : 4
% 408.19/300.16 # Initial clauses : 12
% 408.19/300.16 # Removed in clause preprocessing : 0
% 408.19/300.16 # Initial clauses in saturation : 12
% 408.19/300.16 # Processed clauses : 25
% 408.19/300.16 # ...of these trivial : 0
% 408.19/300.16 # ...subsumed : 0
% 408.19/300.16 # ...remaining for further processing : 25
% 408.19/300.16 # Other redundant clauses eliminated : 0
% 408.19/300.16 # Clauses deleted for lack of memory : 0
% 408.19/300.16 # Backward-subsumed : 1
% 408.19/300.16 # Backward-rewritten : 0
% 408.19/300.16 # Generated clauses : 8
% 408.19/300.16 # ...of the previous two non-redundant : 5
% 408.19/300.16 # ...aggressively subsumed : 0
% 408.19/300.16 # Contextual simplify-reflections : 0
% 408.19/300.16 # Paramodulations : 7
% 408.19/300.16 # Factorizations : 0
% 408.19/300.16 # NegExts : 0
% 408.19/300.16 # Equation resolutions : 0
% 408.19/300.16 # Total rewrite steps : 0
% 408.19/300.16 # Propositional unsat checks : 0
% 408.19/300.16 # Propositional check models : 0
% 408.19/300.16 # Propositional check unsatisfiable : 0
% 408.19/300.16 # Propositional clauses : 0
% 408.19/300.16 # Propositional clauses after purity: 0
% 408.19/300.16 # Propositional unsat core size : 0
% 408.19/300.16 # Propositional preprocessing time : 0.000
% 408.19/300.16 # Propositional encoding time : 0.000
% 408.19/300.16 # Propositional solver time : 0.000
% 408.19/300.16 # Success case prop preproc time : 0.000
% 408.19/300.16 # Success case prop encoding time : 0.000
% 408.19/300.16 # Success case prop solver time : 0.000
% 408.19/300.16 # Current number of processed clauses : 11
% 408.19/300.16 # Positive orientable unit clauses : 6
% 408.19/300.16 # Positive unorientable unit clauses: 0
% 408.19/300.16 # Negative unit clauses : 2
% 408.19/300.16 # Non-unit-clauses : 3
% 408.19/300.16 # Current number of unprocessed clauses: 3
% 408.19/300.16 # ...number of literals in the above : 5
% 408.19/300.16 # Current number of archived formulas : 0
% 408.19/300.16 # Current number of archived clauses : 14
% 408.19/300.16 # Clause-clause subsumption calls (NU) : 0
% 408.19/300.16 # Rec. Clause-clause subsumption calls : 0
% 408.19/300.16 # Non-unit clause-clause subsumptions : 0
% 408.19/300.16 # Unit Clause-clause subsumption calls : 5
% 408.19/300.16 # Rewrite failures with RHS unbound : 0
% 408.19/300.16 # BW rewrite match attempts : 2
% 408.19/300.16 # BW rewrite match successes : 0
% 408.19/300.16 # Condensation attempts : 0
% 408.19/300.16 # Condensation successes : 0
% 408.19/300.16 # Termbank termtop insertions : 525
% 408.19/300.16
% 408.19/300.16 # -------------------------------------------------
% 408.19/300.16 # User time : 0.003 s
% 408.19/300.16 # System time : 0.002 s
% 408.19/300.16 # Total time : 0.005 s
% 408.19/300.16 # Maximum resident set size: 1776 pages
% 408.19/300.16
% 408.19/300.16 # -------------------------------------------------
% 408.19/300.16 # User time : 0.005 s
% 408.19/300.16 # System time : 0.004 s
% 408.19/300.16 # Total time : 0.008 s
% 408.19/300.16 # Maximum resident set size: 1684 pages
% 408.19/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------