TSTP Solution File: SET012-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET012-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:17:52 EDT 2023
% Result : Unsatisfiable 33.99s 4.91s
% Output : CNFRefutation 33.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 11 unt; 11 nHn; 20 RR)
% Number of literals : 58 ( 16 equ; 20 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',complement1) ).
cnf(extensionality2,axiom,
( member(f1(X1,X2),X1)
| member(f1(X1,X2),X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',extensionality2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ little_set(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',complement2) ).
cnf(extensionality1,axiom,
( little_set(f1(X1,X2))
| X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',extensionality1) ).
cnf(complement_of_a_is_b,hypothesis,
complement(as) = bs,
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',complement_of_a_is_b) ).
cnf(complement_of_b_is_c,hypothesis,
complement(bs) = cs,
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',complement_of_b_is_c) ).
cnf(prove_a_equals_c,negated_conjecture,
as != cs,
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',prove_a_equals_c) ).
cnf(a2,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',a2) ).
cnf(extensionality3,axiom,
( X1 = X2
| ~ member(f1(X1,X2),X1)
| ~ member(f1(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.nBWBfbVWrs/E---3.1_12958.p',extensionality3) ).
cnf(c_0_9,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_10,axiom,
( member(f1(X1,X2),X1)
| member(f1(X1,X2),X2)
| X1 = X2 ),
extensionality2 ).
cnf(c_0_11,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ little_set(X1) ),
complement2 ).
cnf(c_0_12,axiom,
( little_set(f1(X1,X2))
| X1 = X2 ),
extensionality1 ).
cnf(c_0_13,plain,
( complement(X1) = X2
| member(f1(complement(X1),X2),X2)
| ~ member(f1(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X1 = X2
| member(f1(X1,X2),complement(X3))
| member(f1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( complement(complement(X1)) = X2
| member(f1(complement(complement(X1)),X2),X1)
| member(f1(complement(complement(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,hypothesis,
complement(as) = bs,
complement_of_a_is_b ).
cnf(c_0_17,hypothesis,
complement(bs) = cs,
complement_of_b_is_c ).
cnf(c_0_18,hypothesis,
( cs = X1
| member(f1(cs,X1),as)
| member(f1(cs,X1),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
as != cs,
prove_a_equals_c ).
cnf(c_0_20,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
a2 ).
cnf(c_0_21,hypothesis,
member(f1(cs,as),as),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_18]),c_0_19]) ).
cnf(c_0_22,hypothesis,
( ~ member(X1,bs)
| ~ member(X1,as) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_23,axiom,
( X1 = X2
| ~ member(f1(X1,X2),X1)
| ~ member(f1(X1,X2),X2) ),
extensionality3 ).
cnf(c_0_24,hypothesis,
( member(X1,bs)
| member(X1,cs)
| ~ little_set(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_25,hypothesis,
little_set(f1(cs,as)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
~ member(f1(cs,as),bs),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,hypothesis,
~ member(f1(cs,as),cs),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_19]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SET012-3 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:18:49 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.nBWBfbVWrs/E---3.1_12958.p
% 33.99/4.91 # Version: 3.1pre001
% 33.99/4.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 33.99/4.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.99/4.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.99/4.91 # Starting new_bool_3 with 300s (1) cores
% 33.99/4.91 # Starting new_bool_1 with 300s (1) cores
% 33.99/4.91 # Starting sh5l with 300s (1) cores
% 33.99/4.91 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 13036 completed with status 0
% 33.99/4.91 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 33.99/4.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 33.99/4.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.99/4.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.99/4.91 # No SInE strategy applied
% 33.99/4.91 # Search class: FGHSF-FFLS31-MFFFFFNN
% 33.99/4.91 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 33.99/4.91 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.99/4.91 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 33.99/4.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 33.99/4.91 # Starting new_bool_3 with 216s (1) cores
% 33.99/4.91 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 33.99/4.91 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 33.99/4.91 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 13044 completed with status 0
% 33.99/4.91 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 33.99/4.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 33.99/4.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.99/4.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 33.99/4.91 # No SInE strategy applied
% 33.99/4.91 # Search class: FGHSF-FFLS31-MFFFFFNN
% 33.99/4.91 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 33.99/4.91 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.99/4.91 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 33.99/4.91 # Preprocessing time : 0.003 s
% 33.99/4.91
% 33.99/4.91 # Proof found!
% 33.99/4.91 # SZS status Unsatisfiable
% 33.99/4.91 # SZS output start CNFRefutation
% See solution above
% 33.99/4.91 # Parsed axioms : 144
% 33.99/4.91 # Removed by relevancy pruning/SinE : 0
% 33.99/4.91 # Initial clauses : 144
% 33.99/4.91 # Removed in clause preprocessing : 6
% 33.99/4.91 # Initial clauses in saturation : 138
% 33.99/4.91 # Processed clauses : 5985
% 33.99/4.91 # ...of these trivial : 333
% 33.99/4.91 # ...subsumed : 3023
% 33.99/4.91 # ...remaining for further processing : 2629
% 33.99/4.91 # Other redundant clauses eliminated : 1618
% 33.99/4.91 # Clauses deleted for lack of memory : 0
% 33.99/4.91 # Backward-subsumed : 131
% 33.99/4.91 # Backward-rewritten : 88
% 33.99/4.91 # Generated clauses : 137409
% 33.99/4.91 # ...of the previous two non-redundant : 125694
% 33.99/4.91 # ...aggressively subsumed : 0
% 33.99/4.91 # Contextual simplify-reflections : 289
% 33.99/4.91 # Paramodulations : 134643
% 33.99/4.91 # Factorizations : 848
% 33.99/4.91 # NegExts : 0
% 33.99/4.91 # Equation resolutions : 1917
% 33.99/4.91 # Total rewrite steps : 41673
% 33.99/4.91 # Propositional unsat checks : 0
% 33.99/4.91 # Propositional check models : 0
% 33.99/4.91 # Propositional check unsatisfiable : 0
% 33.99/4.91 # Propositional clauses : 0
% 33.99/4.91 # Propositional clauses after purity: 0
% 33.99/4.91 # Propositional unsat core size : 0
% 33.99/4.91 # Propositional preprocessing time : 0.000
% 33.99/4.91 # Propositional encoding time : 0.000
% 33.99/4.91 # Propositional solver time : 0.000
% 33.99/4.91 # Success case prop preproc time : 0.000
% 33.99/4.91 # Success case prop encoding time : 0.000
% 33.99/4.91 # Success case prop solver time : 0.000
% 33.99/4.91 # Current number of processed clauses : 2406
% 33.99/4.91 # Positive orientable unit clauses : 82
% 33.99/4.91 # Positive unorientable unit clauses: 0
% 33.99/4.91 # Negative unit clauses : 39
% 33.99/4.91 # Non-unit-clauses : 2285
% 33.99/4.91 # Current number of unprocessed clauses: 119519
% 33.99/4.91 # ...number of literals in the above : 512083
% 33.99/4.91 # Current number of archived formulas : 0
% 33.99/4.91 # Current number of archived clauses : 226
% 33.99/4.91 # Clause-clause subsumption calls (NU) : 760979
% 33.99/4.91 # Rec. Clause-clause subsumption calls : 223279
% 33.99/4.91 # Non-unit clause-clause subsumptions : 1781
% 33.99/4.91 # Unit Clause-clause subsumption calls : 33105
% 33.99/4.91 # Rewrite failures with RHS unbound : 0
% 33.99/4.91 # BW rewrite match attempts : 46
% 33.99/4.91 # BW rewrite match successes : 31
% 33.99/4.91 # Condensation attempts : 0
% 33.99/4.91 # Condensation successes : 0
% 33.99/4.91 # Termbank termtop insertions : 3998327
% 33.99/4.91
% 33.99/4.91 # -------------------------------------------------
% 33.99/4.91 # User time : 3.899 s
% 33.99/4.91 # System time : 0.130 s
% 33.99/4.91 # Total time : 4.029 s
% 33.99/4.91 # Maximum resident set size: 2092 pages
% 33.99/4.91
% 33.99/4.91 # -------------------------------------------------
% 33.99/4.91 # User time : 20.769 s
% 33.99/4.91 # System time : 0.635 s
% 33.99/4.91 # Total time : 21.404 s
% 33.99/4.91 # Maximum resident set size: 1804 pages
% 33.99/4.91 % E---3.1 exiting
% 33.99/4.91 % E---3.1 exiting
%------------------------------------------------------------------------------