TSTP Solution File: SET194+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET194+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:22:25 EDT 2023
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 38 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 32 ( 12 ~; 13 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 3 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ft0rzvtTFj/E---3.1_9735.p',subset_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ft0rzvtTFj/E---3.1_9735.p',union_defn) ).
fof(prove_subset_of_union,conjecture,
! [X1,X2] : subset(X1,union(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Ft0rzvtTFj/E---3.1_9735.p',prove_subset_of_union) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.Ft0rzvtTFj/E---3.1_9735.p',commutativity_of_union) ).
fof(c_0_4,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk3_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk3_2(X9,X10),X10)
| subset(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_defn])])])])])]) ).
fof(c_0_5,plain,
! [X13,X14,X15] :
( ( ~ member(X15,union(X13,X14))
| member(X15,X13)
| member(X15,X14) )
& ( ~ member(X15,X13)
| member(X15,union(X13,X14)) )
& ( ~ member(X15,X14)
| member(X15,union(X13,X14)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).
cnf(c_0_6,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] : subset(X1,union(X1,X2)),
inference(assume_negation,[status(cth)],[prove_subset_of_union]) ).
cnf(c_0_9,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X16,X17] : union(X16,X17) = union(X17,X16),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
fof(c_0_12,negated_conjecture,
~ subset(esk1_0,union(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ subset(esk1_0,union(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SET194+3 : TPTP v8.1.2. Released v2.2.0.
% 0.04/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n010.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 2400
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Mon Oct 2 16:57:05 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.13/0.39 Running first-order model finding
% 0.13/0.39 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.Ft0rzvtTFj/E---3.1_9735.p
% 0.13/0.40 # Version: 3.1pre001
% 0.13/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # new_bool_3 with pid 9813 completed with status 0
% 0.13/0.40 # Result found by new_bool_3
% 0.13/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.40 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.13/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.40 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.13/0.40 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 9816 completed with status 0
% 0.13/0.40 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.40 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.13/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.40 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.13/0.40 # Preprocessing time : 0.001 s
% 0.13/0.40 # Presaturation interreduction done
% 0.13/0.40
% 0.13/0.40 # Proof found!
% 0.13/0.40 # SZS status Theorem
% 0.13/0.40 # SZS output start CNFRefutation
% See solution above
% 0.13/0.40 # Parsed axioms : 6
% 0.13/0.40 # Removed by relevancy pruning/SinE : 0
% 0.13/0.40 # Initial clauses : 13
% 0.13/0.40 # Removed in clause preprocessing : 2
% 0.13/0.40 # Initial clauses in saturation : 11
% 0.13/0.40 # Processed clauses : 29
% 0.13/0.40 # ...of these trivial : 0
% 0.13/0.40 # ...subsumed : 4
% 0.13/0.40 # ...remaining for further processing : 25
% 0.13/0.40 # Other redundant clauses eliminated : 0
% 0.13/0.40 # Clauses deleted for lack of memory : 0
% 0.13/0.40 # Backward-subsumed : 0
% 0.13/0.40 # Backward-rewritten : 1
% 0.13/0.40 # Generated clauses : 31
% 0.13/0.40 # ...of the previous two non-redundant : 21
% 0.13/0.40 # ...aggressively subsumed : 0
% 0.13/0.40 # Contextual simplify-reflections : 0
% 0.13/0.40 # Paramodulations : 29
% 0.13/0.40 # Factorizations : 2
% 0.13/0.40 # NegExts : 0
% 0.13/0.40 # Equation resolutions : 0
% 0.13/0.40 # Total rewrite steps : 2
% 0.13/0.40 # Propositional unsat checks : 0
% 0.13/0.40 # Propositional check models : 0
% 0.13/0.40 # Propositional check unsatisfiable : 0
% 0.13/0.40 # Propositional clauses : 0
% 0.13/0.40 # Propositional clauses after purity: 0
% 0.13/0.40 # Propositional unsat core size : 0
% 0.13/0.40 # Propositional preprocessing time : 0.000
% 0.13/0.40 # Propositional encoding time : 0.000
% 0.13/0.40 # Propositional solver time : 0.000
% 0.13/0.40 # Success case prop preproc time : 0.000
% 0.13/0.40 # Success case prop encoding time : 0.000
% 0.13/0.40 # Success case prop solver time : 0.000
% 0.13/0.40 # Current number of processed clauses : 13
% 0.13/0.40 # Positive orientable unit clauses : 3
% 0.13/0.40 # Positive unorientable unit clauses: 1
% 0.13/0.40 # Negative unit clauses : 0
% 0.13/0.40 # Non-unit-clauses : 9
% 0.13/0.40 # Current number of unprocessed clauses: 14
% 0.13/0.40 # ...number of literals in the above : 36
% 0.13/0.40 # Current number of archived formulas : 0
% 0.13/0.40 # Current number of archived clauses : 12
% 0.13/0.40 # Clause-clause subsumption calls (NU) : 14
% 0.13/0.40 # Rec. Clause-clause subsumption calls : 14
% 0.13/0.40 # Non-unit clause-clause subsumptions : 4
% 0.13/0.40 # Unit Clause-clause subsumption calls : 2
% 0.13/0.40 # Rewrite failures with RHS unbound : 0
% 0.13/0.40 # BW rewrite match attempts : 11
% 0.13/0.40 # BW rewrite match successes : 5
% 0.13/0.40 # Condensation attempts : 0
% 0.13/0.40 # Condensation successes : 0
% 0.13/0.40 # Termbank termtop insertions : 1002
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.004 s
% 0.13/0.40 # System time : 0.001 s
% 0.13/0.40 # Total time : 0.005 s
% 0.13/0.40 # Maximum resident set size: 1728 pages
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.005 s
% 0.13/0.40 # System time : 0.002 s
% 0.13/0.40 # Total time : 0.007 s
% 0.13/0.40 # Maximum resident set size: 1676 pages
% 0.13/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------