TSTP Solution File: SET018-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET018-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Tue May 21 02:52:28 EDT 2024
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of clauses : 46 ( 24 unt; 14 nHn; 36 RR)
% Number of literals : 76 ( 51 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 41 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_3,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_3) ).
cnf(unordered_pair_1,axiom,
member(X1,unordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_1) ).
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = unordered_pair(singleton_set(X1),unordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
cnf(equal_ordered_pairs,hypothesis,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pairs) ).
cnf(singleton_2,axiom,
( X1 = X2
| ~ member(X1,singleton_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_2) ).
cnf(singleton_1,axiom,
member(X1,singleton_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_1) ).
cnf(unordered_pair_2,axiom,
member(X1,unordered_pair(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_2) ).
cnf(prove_second_components_equal,negated_conjecture,
r1 != r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_second_components_equal) ).
cnf(c_0_8,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_3]) ).
cnf(c_0_9,axiom,
member(X1,unordered_pair(X1,X2)),
unordered_pair_1 ).
cnf(c_0_10,axiom,
ordered_pair(X1,X2) = unordered_pair(singleton_set(X1),unordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_11,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_8 ).
cnf(c_0_12,plain,
member(singleton_set(X1),ordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,hypothesis,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
equal_ordered_pairs ).
cnf(c_0_14,plain,
( X1 = unordered_pair(X2,X3)
| X1 = singleton_set(X2)
| ~ member(X1,ordered_pair(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_15,hypothesis,
member(singleton_set(m1),ordered_pair(m2,r2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ member(X1,singleton_set(X2)) ),
inference(fof_simplification,[status(thm)],[singleton_2]) ).
cnf(c_0_17,axiom,
member(X1,singleton_set(X1)),
singleton_1 ).
cnf(c_0_18,hypothesis,
( singleton_set(m1) = unordered_pair(m2,r2)
| singleton_set(m1) = singleton_set(m2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
member(X1,unordered_pair(X2,X1)),
unordered_pair_2 ).
cnf(c_0_20,plain,
( X1 = X2
| ~ member(X1,singleton_set(X2)) ),
c_0_16 ).
cnf(c_0_21,hypothesis,
( singleton_set(m1) = unordered_pair(m2,r2)
| member(m1,singleton_set(m2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
member(unordered_pair(X1,X2),ordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_23,hypothesis,
( singleton_set(m1) = unordered_pair(m2,r2)
| m1 = m2 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,hypothesis,
member(unordered_pair(m1,r1),ordered_pair(m2,r2)),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_25,hypothesis,
( m1 = m2
| X1 = m1
| ~ member(X1,unordered_pair(m2,r2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_26,hypothesis,
( unordered_pair(m1,r1) = unordered_pair(m2,r2)
| singleton_set(m2) = unordered_pair(m1,r1) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_27,hypothesis,
m1 = m2,
inference(spm,[status(thm)],[c_0_25,c_0_9]) ).
cnf(c_0_28,hypothesis,
( unordered_pair(m2,r1) = unordered_pair(m2,r2)
| singleton_set(m2) = unordered_pair(m2,r1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_29,hypothesis,
( unordered_pair(m2,r1) = unordered_pair(m2,r2)
| X1 = m2
| ~ member(X1,unordered_pair(m2,r1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_30,hypothesis,
( unordered_pair(m2,r1) = unordered_pair(m2,r2)
| m2 = r1 ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_31,negated_conjecture,
r1 != r2,
inference(fof_simplification,[status(thm)],[prove_second_components_equal]) ).
cnf(c_0_32,hypothesis,
( singleton_set(m1) = unordered_pair(m2,r2)
| singleton_set(m2) != unordered_pair(m2,r2) ),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_33,hypothesis,
( m2 = r1
| member(r1,unordered_pair(m2,r2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
r1 != r2,
c_0_31 ).
cnf(c_0_35,hypothesis,
( X1 = m1
| singleton_set(m2) != unordered_pair(m2,r2)
| ~ member(X1,unordered_pair(m2,r2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_36,hypothesis,
ordered_pair(m2,r1) = ordered_pair(m2,r2),
inference(rw,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_37,hypothesis,
m2 = r1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_34]) ).
cnf(c_0_38,hypothesis,
( m1 = r2
| singleton_set(m2) != unordered_pair(m2,r2) ),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_39,hypothesis,
ordered_pair(r1,r1) = ordered_pair(r1,r2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_40,hypothesis,
( m2 = r2
| singleton_set(m2) != unordered_pair(m2,r2) ),
inference(rw,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_41,hypothesis,
( X1 = unordered_pair(r1,r1)
| X1 = singleton_set(r1)
| ~ member(X1,ordered_pair(r1,r2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_39]) ).
cnf(c_0_42,hypothesis,
singleton_set(r1) != unordered_pair(r1,r2),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_37]),c_0_37]),c_0_37]),c_0_34]) ).
cnf(c_0_43,hypothesis,
unordered_pair(r1,r1) = unordered_pair(r1,r2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_22]),c_0_42]) ).
cnf(c_0_44,hypothesis,
( X1 = r1
| ~ member(X1,unordered_pair(r1,r2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_43]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_19]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET018-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 13:26:53 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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/benchmark/theBenchmark.p
% 0.20/0.47 # Version: 3.1.0
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # new_bool_3 with pid 27247 completed with status 0
% 0.20/0.47 # Result found by new_bool_3
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 # Search class: FGUSM-FFSF21-SFFFFFNN
% 0.20/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.47 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27252 completed with status 0
% 0.20/0.47 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 # Search class: FGUSM-FFSF21-SFFFFFNN
% 0.20/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47 # Presaturation interreduction done
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Unsatisfiable
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 8
% 0.20/0.47 # Removed by relevancy pruning/SinE : 0
% 0.20/0.47 # Initial clauses : 8
% 0.20/0.47 # Removed in clause preprocessing : 0
% 0.20/0.47 # Initial clauses in saturation : 8
% 0.20/0.47 # Processed clauses : 60
% 0.20/0.47 # ...of these trivial : 4
% 0.20/0.47 # ...subsumed : 5
% 0.20/0.47 # ...remaining for further processing : 51
% 0.20/0.47 # Other redundant clauses eliminated : 0
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 0
% 0.20/0.47 # Backward-rewritten : 23
% 0.20/0.47 # Generated clauses : 99
% 0.20/0.47 # ...of the previous two non-redundant : 82
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 0
% 0.20/0.47 # Paramodulations : 98
% 0.20/0.47 # Factorizations : 1
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 0
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 95
% 0.20/0.47 # ...of those cached : 68
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 20
% 0.20/0.47 # Positive orientable unit clauses : 14
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 2
% 0.20/0.47 # Non-unit-clauses : 4
% 0.20/0.47 # Current number of unprocessed clauses: 32
% 0.20/0.47 # ...number of literals in the above : 65
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 31
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 27
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 27
% 0.20/0.47 # Non-unit clause-clause subsumptions : 4
% 0.20/0.47 # Unit Clause-clause subsumption calls : 0
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 7
% 0.20/0.47 # BW rewrite match successes : 3
% 0.20/0.47 # Condensation attempts : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 1372
% 0.20/0.47 # Search garbage collected termcells : 8
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.003 s
% 0.20/0.47 # System time : 0.003 s
% 0.20/0.47 # Total time : 0.006 s
% 0.20/0.47 # Maximum resident set size: 1628 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.003 s
% 0.20/0.47 # System time : 0.006 s
% 0.20/0.47 # Total time : 0.009 s
% 0.20/0.47 # Maximum resident set size: 1696 pages
% 0.20/0.47 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------