TSTP Solution File: SET134-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET134-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:57:46 EDT 2024
% Result : Unsatisfiable 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 15 unt; 10 nHn; 19 RR)
% Number of literals : 64 ( 17 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_corollary_2_to_member_of_triple_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_member_of_triple_1) ).
cnf(prove_corollary_2_to_member_of_triple_2,negated_conjecture,
set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_member_of_triple_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(c_0_10,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_11,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_12,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_13,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
member(u,universal_class),
prove_corollary_2_to_member_of_triple_1 ).
cnf(c_0_15,negated_conjecture,
set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
prove_corollary_2_to_member_of_triple_2 ).
cnf(c_0_16,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_18,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_19,negated_conjecture,
( member(u,complement(X1))
| member(u,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))) = null_class,
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_15,c_0_16]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_21,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_22,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))
| member(u,null_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
( member(u,complement(unordered_pair(u,u)))
| member(u,null_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_27,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_28,negated_conjecture,
( member(u,null_class)
| ~ member(u,unordered_pair(u,u)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_26 ).
cnf(c_0_30,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
member(u,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14])]) ).
cnf(c_0_32,negated_conjecture,
( X1 = null_class
| member(u,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( complement(X1) = null_class
| ~ member(u,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(u,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
~ member(u,X1),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_35]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET134-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 12:48:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.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 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8812 completed with status 0
% 0.22/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 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 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 308s (1) cores
% 0.22/0.53 # Starting sh5l with 304s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.53 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 8823 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 308s (1) cores
% 0.22/0.53 # Starting sh5l with 304s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (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 : 94
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 94
% 0.22/0.53 # Removed in clause preprocessing : 16
% 0.22/0.53 # Initial clauses in saturation : 78
% 0.22/0.53 # Processed clauses : 152
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 152
% 0.22/0.53 # Other redundant clauses eliminated : 3
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 6
% 0.22/0.53 # Backward-rewritten : 3
% 0.22/0.53 # Generated clauses : 144
% 0.22/0.53 # ...of the previous two non-redundant : 124
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 136
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 3
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 20
% 0.22/0.53 # ...of those cached : 16
% 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 : 58
% 0.22/0.53 # Positive orientable unit clauses : 16
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 41
% 0.22/0.53 # Current number of unprocessed clauses: 126
% 0.22/0.53 # ...number of literals in the above : 327
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 107
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 1777
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 773
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 91
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 6
% 0.22/0.53 # BW rewrite match successes : 2
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 8170
% 0.22/0.53 # Search garbage collected termcells : 154
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.018 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.020 s
% 0.22/0.53 # Maximum resident set size: 1940 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.074 s
% 0.22/0.53 # System time : 0.011 s
% 0.22/0.53 # Total time : 0.086 s
% 0.22/0.53 # Maximum resident set size: 1784 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------