TSTP Solution File: SET071-7 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET071-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:21:57 EDT 2023
% Result : Unsatisfiable 0.21s 0.57s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 20 unt; 7 nHn; 20 RR)
% Number of literals : 50 ( 23 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_equals_singleton1,axiom,
( member(X1,universal_class)
| unordered_pair(X2,X1) = singleton(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',unordered_pair_equals_singleton1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',singleton_set) ).
cnf(prove_null_unordered_pair_3,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',prove_null_unordered_pair_3) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',unordered_pair_member) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',commutativity_of_unordered_pair) ).
cnf(prove_null_unordered_pair_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',prove_null_unordered_pair_2) ).
cnf(prove_null_unordered_pair_1,negated_conjecture,
unordered_pair(x,y) != null_class,
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',prove_null_unordered_pair_1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',regularity1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.iyNb36Z5x3/E---3.1_30086.p',class_elements_are_sets) ).
cnf(c_0_10,axiom,
( member(X1,universal_class)
| unordered_pair(X2,X1) = singleton(X2) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,negated_conjecture,
~ member(y,universal_class),
prove_null_unordered_pair_3 ).
cnf(c_0_13,plain,
( unordered_pair(X2,X1) = unordered_pair(X2,X2)
| member(X1,universal_class) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_15,negated_conjecture,
unordered_pair(X1,y) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| ~ member(X1,unordered_pair(X2,y)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_18,negated_conjecture,
~ member(x,universal_class),
prove_null_unordered_pair_2 ).
cnf(c_0_19,negated_conjecture,
( X1 = X2
| ~ member(X1,unordered_pair(y,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
unordered_pair(X1,x) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
unordered_pair(x,y) != null_class,
prove_null_unordered_pair_1 ).
cnf(c_0_22,negated_conjecture,
( X1 = y
| ~ member(X1,unordered_pair(x,x)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_15]) ).
cnf(c_0_23,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_24,negated_conjecture,
unordered_pair(x,x) != null_class,
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
regular(unordered_pair(x,x)) = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
member(y,unordered_pair(x,x)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
y = x,
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_28,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_29,negated_conjecture,
member(x,unordered_pair(x,x)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( member(x,X1)
| ~ subclass(unordered_pair(x,x),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SET071-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 16:31:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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.iyNb36Z5x3/E---3.1_30086.p
% 0.21/0.57 # Version: 3.1pre001
% 0.21/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 # Starting sh5l with 300s (1) cores
% 0.21/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30163 completed with status 0
% 0.21/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.57 # No SInE strategy applied
% 0.21/0.57 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.21/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 308s (1) cores
% 0.21/0.57 # Starting sh5l with 304s (1) cores
% 0.21/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30170 completed with status 0
% 0.21/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.57 # No SInE strategy applied
% 0.21/0.57 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.21/0.57 # Preprocessing time : 0.004 s
% 0.21/0.57 # Presaturation interreduction done
% 0.21/0.57
% 0.21/0.57 # Proof found!
% 0.21/0.57 # SZS status Unsatisfiable
% 0.21/0.57 # SZS output start CNFRefutation
% See solution above
% 0.21/0.57 # Parsed axioms : 115
% 0.21/0.57 # Removed by relevancy pruning/SinE : 0
% 0.21/0.57 # Initial clauses : 115
% 0.21/0.57 # Removed in clause preprocessing : 15
% 0.21/0.57 # Initial clauses in saturation : 100
% 0.21/0.57 # Processed clauses : 290
% 0.21/0.57 # ...of these trivial : 2
% 0.21/0.57 # ...subsumed : 70
% 0.21/0.57 # ...remaining for further processing : 218
% 0.21/0.57 # Other redundant clauses eliminated : 3
% 0.21/0.57 # Clauses deleted for lack of memory : 0
% 0.21/0.57 # Backward-subsumed : 0
% 0.21/0.57 # Backward-rewritten : 7
% 0.21/0.57 # Generated clauses : 468
% 0.21/0.57 # ...of the previous two non-redundant : 389
% 0.21/0.57 # ...aggressively subsumed : 0
% 0.21/0.57 # Contextual simplify-reflections : 0
% 0.21/0.57 # Paramodulations : 465
% 0.21/0.57 # Factorizations : 0
% 0.21/0.57 # NegExts : 0
% 0.21/0.57 # Equation resolutions : 3
% 0.21/0.57 # Total rewrite steps : 99
% 0.21/0.57 # Propositional unsat checks : 0
% 0.21/0.57 # Propositional check models : 0
% 0.21/0.57 # Propositional check unsatisfiable : 0
% 0.21/0.57 # Propositional clauses : 0
% 0.21/0.57 # Propositional clauses after purity: 0
% 0.21/0.57 # Propositional unsat core size : 0
% 0.21/0.57 # Propositional preprocessing time : 0.000
% 0.21/0.57 # Propositional encoding time : 0.000
% 0.21/0.57 # Propositional solver time : 0.000
% 0.21/0.57 # Success case prop preproc time : 0.000
% 0.21/0.57 # Success case prop encoding time : 0.000
% 0.21/0.57 # Success case prop solver time : 0.000
% 0.21/0.57 # Current number of processed clauses : 111
% 0.21/0.57 # Positive orientable unit clauses : 24
% 0.21/0.57 # Positive unorientable unit clauses: 3
% 0.21/0.57 # Negative unit clauses : 6
% 0.21/0.57 # Non-unit-clauses : 78
% 0.21/0.57 # Current number of unprocessed clauses: 278
% 0.21/0.57 # ...number of literals in the above : 655
% 0.21/0.57 # Current number of archived formulas : 0
% 0.21/0.57 # Current number of archived clauses : 119
% 0.21/0.57 # Clause-clause subsumption calls (NU) : 1566
% 0.21/0.57 # Rec. Clause-clause subsumption calls : 1288
% 0.21/0.57 # Non-unit clause-clause subsumptions : 41
% 0.21/0.57 # Unit Clause-clause subsumption calls : 195
% 0.21/0.57 # Rewrite failures with RHS unbound : 0
% 0.21/0.57 # BW rewrite match attempts : 42
% 0.21/0.57 # BW rewrite match successes : 26
% 0.21/0.57 # Condensation attempts : 0
% 0.21/0.57 # Condensation successes : 0
% 0.21/0.57 # Termbank termtop insertions : 10149
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.023 s
% 0.21/0.57 # System time : 0.006 s
% 0.21/0.57 # Total time : 0.029 s
% 0.21/0.57 # Maximum resident set size: 1972 pages
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.120 s
% 0.21/0.57 # System time : 0.016 s
% 0.21/0.57 # Total time : 0.136 s
% 0.21/0.57 # Maximum resident set size: 1768 pages
% 0.21/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------