TSTP Solution File: SET104-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET104-7 : TPTP v8.1.2. Bugfixed v2.1.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:18:04 EDT 2024
% Result : Unsatisfiable 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 19 unt; 6 nHn; 11 RR)
% Number of literals : 31 ( 21 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_property_2_of_ordered_pair_2,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',prove_property_2_of_ordered_pair_2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',singleton_set) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',ordered_pair) ).
cnf(prove_property_2_of_ordered_pair_3,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',prove_property_2_of_ordered_pair_3) ).
cnf(singleton_is_null_class,axiom,
( member(X1,universal_class)
| singleton(X1) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',singleton_is_null_class) ).
cnf(unordered_pair_equals_singleton1,axiom,
( member(X1,universal_class)
| unordered_pair(X2,X1) = singleton(X2) ),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',unordered_pair_equals_singleton1) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p',commutativity_of_unordered_pair) ).
cnf(c_0_7,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_property_2_of_ordered_pair_2]) ).
cnf(c_0_8,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
c_0_7 ).
cnf(c_0_9,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_10,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_11,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_property_2_of_ordered_pair_3]) ).
cnf(c_0_12,axiom,
( member(X1,universal_class)
| singleton(X1) = null_class ),
singleton_is_null_class ).
cnf(c_0_13,negated_conjecture,
ordered_pair(x,y) != unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ member(x,universal_class),
c_0_11 ).
cnf(c_0_16,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,axiom,
( member(X1,universal_class)
| unordered_pair(X2,X1) = singleton(X2) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_18,negated_conjecture,
unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( unordered_pair(X1,X2) = unordered_pair(X1,X1)
| member(X2,universal_class) ),
inference(rw,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_21,negated_conjecture,
unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))) != unordered_pair(null_class,unordered_pair(x,unordered_pair(y,y))),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(X1,x) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_23,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_23]),c_0_23]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SET104-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n010.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 09:53:18 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.bQdU1DzOH7/E---3.1_3169.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_3 with pid 3279 completed with status 0
% 0.22/0.53 # Result found by new_bool_3
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.22/0.53 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 3284 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 149
% 0.22/0.53 # Removed by relevancy pruning/SinE : 96
% 0.22/0.53 # Initial clauses : 53
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 53
% 0.22/0.53 # Processed clauses : 172
% 0.22/0.53 # ...of these trivial : 1
% 0.22/0.53 # ...subsumed : 51
% 0.22/0.53 # ...remaining for further processing : 120
% 0.22/0.53 # Other redundant clauses eliminated : 4
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 1
% 0.22/0.53 # Backward-rewritten : 17
% 0.22/0.53 # Generated clauses : 382
% 0.22/0.53 # ...of the previous two non-redundant : 211
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 365
% 0.22/0.53 # Factorizations : 12
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 5
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 170
% 0.22/0.53 # ...of those cached : 112
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 54
% 0.22/0.53 # Positive orientable unit clauses : 15
% 0.22/0.53 # Positive unorientable unit clauses: 2
% 0.22/0.53 # Negative unit clauses : 3
% 0.22/0.53 # Non-unit-clauses : 34
% 0.22/0.53 # Current number of unprocessed clauses: 138
% 0.22/0.53 # ...number of literals in the above : 338
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 64
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 228
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 203
% 0.22/0.53 # Non-unit clause-clause subsumptions : 41
% 0.22/0.53 # Unit Clause-clause subsumption calls : 12
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 84
% 0.22/0.53 # BW rewrite match successes : 61
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 5459
% 0.22/0.53 # Search garbage collected termcells : 517
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.012 s
% 0.22/0.53 # System time : 0.003 s
% 0.22/0.53 # Total time : 0.015 s
% 0.22/0.53 # Maximum resident set size: 1904 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.016 s
% 0.22/0.53 # System time : 0.005 s
% 0.22/0.53 # Total time : 0.021 s
% 0.22/0.53 # Maximum resident set size: 1808 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------