TSTP Solution File: SET694+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET694+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:20:16 EDT 2023
% Result : Theorem 4.51s 0.97s
% Output : CNFRefutation 4.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 74 ( 27 ~; 38 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 8 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.c53y2o27EW/E---3.1_13884.p',power_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.c53y2o27EW/E---3.1_13884.p',subset) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.c53y2o27EW/E---3.1_13884.p',union) ).
fof(thI22,conjecture,
! [X1,X2] : subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
file('/export/starexec/sandbox2/tmp/tmp.c53y2o27EW/E---3.1_13884.p',thI22) ).
fof(c_0_4,plain,
! [X16,X17] :
( ( ~ member(X16,power_set(X17))
| subset(X16,X17) )
& ( ~ subset(X16,X17)
| member(X16,power_set(X17)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ subset(X8,X9)
| ~ member(X10,X8)
| member(X10,X9) )
& ( member(esk3_2(X11,X12),X11)
| subset(X11,X12) )
& ( ~ member(esk3_2(X11,X12),X12)
| subset(X11,X12) ) ),
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])])])])])]) ).
cnf(c_0_6,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X18,X19,X20] :
( ( ~ member(X18,union(X19,X20))
| member(X18,X19)
| member(X18,X20) )
& ( ~ member(X18,X19)
| member(X18,union(X19,X20)) )
& ( ~ member(X18,X20)
| member(X18,union(X19,X20)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).
cnf(c_0_9,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( subset(esk3_2(power_set(X1),X2),X1)
| subset(power_set(X1),X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( member(X1,X2)
| subset(power_set(X2),X3)
| ~ member(X1,esk3_2(power_set(X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( member(esk3_2(esk3_2(power_set(X1),X2),X3),X1)
| subset(esk3_2(power_set(X1),X2),X3)
| subset(power_set(X1),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_18,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_19,plain,
( subset(X1,power_set(X2))
| ~ subset(esk3_2(X1,power_set(X2)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_20,plain,
( subset(esk3_2(power_set(X1),X2),union(X3,X1))
| subset(power_set(X1),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( subset(esk3_2(power_set(X1),X2),union(X1,X3))
| subset(power_set(X1),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
subset(power_set(X1),power_set(union(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
subset(power_set(X1),power_set(union(X1,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_24,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(X1,power_set(X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_25,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_26,negated_conjecture,
~ ! [X1,X2] : subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
inference(assume_negation,[status(cth)],[thI22]) ).
cnf(c_0_27,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_28,plain,
( subset(X1,power_set(union(X2,X3)))
| ~ member(esk3_2(X1,power_set(union(X2,X3))),power_set(X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_29,plain,
( member(esk3_2(union(X1,X2),X3),X1)
| member(esk3_2(union(X1,X2),X3),X2)
| subset(union(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_7]) ).
fof(c_0_30,negated_conjecture,
~ subset(union(power_set(esk1_0),power_set(esk2_0)),power_set(union(esk1_0,esk2_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_31,plain,
( subset(X1,power_set(union(X2,X3)))
| ~ member(esk3_2(X1,power_set(union(X2,X3))),power_set(X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_32,plain,
( member(esk3_2(union(X1,power_set(X2)),power_set(union(X3,X2))),X1)
| subset(union(X1,power_set(X2)),power_set(union(X3,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ subset(union(power_set(esk1_0),power_set(esk2_0)),power_set(union(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET694+4 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 17:15:52 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.c53y2o27EW/E---3.1_13884.p
% 4.51/0.97 # Version: 3.1pre001
% 4.51/0.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.51/0.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.51/0.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.51/0.97 # Starting new_bool_3 with 300s (1) cores
% 4.51/0.97 # Starting new_bool_1 with 300s (1) cores
% 4.51/0.97 # Starting sh5l with 300s (1) cores
% 4.51/0.97 # sh5l with pid 13965 completed with status 0
% 4.51/0.97 # Result found by sh5l
% 4.51/0.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.51/0.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.51/0.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.51/0.97 # Starting new_bool_3 with 300s (1) cores
% 4.51/0.97 # Starting new_bool_1 with 300s (1) cores
% 4.51/0.97 # Starting sh5l with 300s (1) cores
% 4.51/0.97 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.51/0.97 # Search class: FGUNF-FFSF21-SFFFFFNN
% 4.51/0.97 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.51/0.97 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 4.51/0.97 # SAT001_MinMin_p005000_rr_RG with pid 13968 completed with status 0
% 4.51/0.97 # Result found by SAT001_MinMin_p005000_rr_RG
% 4.51/0.97 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.51/0.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.51/0.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.51/0.97 # Starting new_bool_3 with 300s (1) cores
% 4.51/0.97 # Starting new_bool_1 with 300s (1) cores
% 4.51/0.97 # Starting sh5l with 300s (1) cores
% 4.51/0.97 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.51/0.97 # Search class: FGUNF-FFSF21-SFFFFFNN
% 4.51/0.97 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.51/0.97 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 4.51/0.97 # Preprocessing time : 0.001 s
% 4.51/0.97 # Presaturation interreduction done
% 4.51/0.97
% 4.51/0.97 # Proof found!
% 4.51/0.97 # SZS status Theorem
% 4.51/0.97 # SZS output start CNFRefutation
% See solution above
% 4.51/0.97 # Parsed axioms : 12
% 4.51/0.97 # Removed by relevancy pruning/SinE : 7
% 4.51/0.97 # Initial clauses : 12
% 4.51/0.97 # Removed in clause preprocessing : 0
% 4.51/0.97 # Initial clauses in saturation : 12
% 4.51/0.97 # Processed clauses : 2405
% 4.51/0.97 # ...of these trivial : 0
% 4.51/0.97 # ...subsumed : 1613
% 4.51/0.97 # ...remaining for further processing : 792
% 4.51/0.97 # Other redundant clauses eliminated : 0
% 4.51/0.97 # Clauses deleted for lack of memory : 0
% 4.51/0.97 # Backward-subsumed : 0
% 4.51/0.97 # Backward-rewritten : 1
% 4.51/0.97 # Generated clauses : 38096
% 4.51/0.97 # ...of the previous two non-redundant : 37813
% 4.51/0.97 # ...aggressively subsumed : 0
% 4.51/0.97 # Contextual simplify-reflections : 0
% 4.51/0.97 # Paramodulations : 38046
% 4.51/0.97 # Factorizations : 50
% 4.51/0.97 # NegExts : 0
% 4.51/0.97 # Equation resolutions : 0
% 4.51/0.97 # Total rewrite steps : 195
% 4.51/0.97 # Propositional unsat checks : 0
% 4.51/0.97 # Propositional check models : 0
% 4.51/0.97 # Propositional check unsatisfiable : 0
% 4.51/0.97 # Propositional clauses : 0
% 4.51/0.97 # Propositional clauses after purity: 0
% 4.51/0.97 # Propositional unsat core size : 0
% 4.51/0.97 # Propositional preprocessing time : 0.000
% 4.51/0.97 # Propositional encoding time : 0.000
% 4.51/0.97 # Propositional solver time : 0.000
% 4.51/0.97 # Success case prop preproc time : 0.000
% 4.51/0.97 # Success case prop encoding time : 0.000
% 4.51/0.97 # Success case prop solver time : 0.000
% 4.51/0.97 # Current number of processed clauses : 779
% 4.51/0.97 # Positive orientable unit clauses : 276
% 4.51/0.97 # Positive unorientable unit clauses: 0
% 4.51/0.97 # Negative unit clauses : 4
% 4.51/0.97 # Non-unit-clauses : 499
% 4.51/0.97 # Current number of unprocessed clauses: 35432
% 4.51/0.97 # ...number of literals in the above : 89164
% 4.51/0.97 # Current number of archived formulas : 0
% 4.51/0.97 # Current number of archived clauses : 13
% 4.51/0.97 # Clause-clause subsumption calls (NU) : 50439
% 4.51/0.97 # Rec. Clause-clause subsumption calls : 48074
% 4.51/0.97 # Non-unit clause-clause subsumptions : 1613
% 4.51/0.97 # Unit Clause-clause subsumption calls : 2827
% 4.51/0.97 # Rewrite failures with RHS unbound : 0
% 4.51/0.97 # BW rewrite match attempts : 3044
% 4.51/0.97 # BW rewrite match successes : 1
% 4.51/0.97 # Condensation attempts : 0
% 4.51/0.97 # Condensation successes : 0
% 4.51/0.97 # Termbank termtop insertions : 782334
% 4.51/0.97
% 4.51/0.97 # -------------------------------------------------
% 4.51/0.97 # User time : 0.515 s
% 4.51/0.97 # System time : 0.021 s
% 4.51/0.97 # Total time : 0.536 s
% 4.51/0.97 # Maximum resident set size: 1740 pages
% 4.51/0.97
% 4.51/0.97 # -------------------------------------------------
% 4.51/0.97 # User time : 0.515 s
% 4.51/0.97 # System time : 0.024 s
% 4.51/0.97 # Total time : 0.539 s
% 4.51/0.97 # Maximum resident set size: 1684 pages
% 4.51/0.97 % E---3.1 exiting
% 4.51/0.97 % E---3.1 exiting
%------------------------------------------------------------------------------