TSTP Solution File: NUM042-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM042-1 : 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:45:50 EDT 2023
% Result : Unsatisfiable 0.15s 0.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 16 unt; 3 nHn; 17 RR)
% Number of literals : 46 ( 8 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 47 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',subclass_members) ).
cnf(prove_irreflexive_class_property4_1,negated_conjecture,
subclass(x,complement(identity_relation)),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',prove_irreflexive_class_property4_1) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',not_subclass_members2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',intersection1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',not_subclass_members1) ).
cnf(irreflexive2,axiom,
( irreflexive(X1,X2)
| ~ subclass(restrict(X1,X2,X2),complement(identity_relation)) ),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',irreflexive2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',restriction1) ).
cnf(prove_irreflexive_class_property4_2,negated_conjecture,
~ irreflexive(x,domain_of(symmetrization_of(x))),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',prove_irreflexive_class_property4_2) ).
cnf(symmetrization,axiom,
union(X1,inverse(X1)) = symmetrization_of(X1),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',symmetrization) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',inverse) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.2SzN6xcLnq/E---3.1_11839.p',union) ).
cnf(c_0_11,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_12,negated_conjecture,
subclass(x,complement(identity_relation)),
prove_irreflexive_class_property4_1 ).
cnf(c_0_13,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_14,negated_conjecture,
( member(X1,complement(identity_relation))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_16,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_17,axiom,
( irreflexive(X1,X2)
| ~ subclass(restrict(X1,X2,X2),complement(identity_relation)) ),
irreflexive2 ).
cnf(c_0_18,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_19,negated_conjecture,
( subclass(X1,complement(identity_relation))
| ~ member(not_subclass_element(X1,complement(identity_relation)),x) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ irreflexive(x,domain_of(symmetrization_of(x))),
prove_irreflexive_class_property4_2 ).
cnf(c_0_22,axiom,
union(X1,inverse(X1)) = symmetrization_of(X1),
symmetrization ).
cnf(c_0_23,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_24,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_25,plain,
( irreflexive(X1,X2)
| ~ subclass(intersection(X1,cross_product(X2,X2)),complement(identity_relation)) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
subclass(intersection(x,X1),complement(identity_relation)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
~ irreflexive(x,domain_of(complement(intersection(complement(x),complement(domain_of(flip(cross_product(x,universal_class)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
irreflexive(x,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : NUM042-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 13:51:50 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.2SzN6xcLnq/E---3.1_11839.p
% 0.15/0.50 # Version: 3.1pre001
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 # Starting sh5l with 300s (1) cores
% 0.15/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11918 completed with status 0
% 0.15/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # No SInE strategy applied
% 0.15/0.50 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 308s (1) cores
% 0.15/0.50 # Starting sh5l with 304s (1) cores
% 0.15/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11926 completed with status 0
% 0.15/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # No SInE strategy applied
% 0.15/0.50 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.50 # Preprocessing time : 0.003 s
% 0.15/0.50 # Presaturation interreduction done
% 0.15/0.50
% 0.15/0.50 # Proof found!
% 0.15/0.50 # SZS status Unsatisfiable
% 0.15/0.50 # SZS output start CNFRefutation
% See solution above
% 0.15/0.50 # Parsed axioms : 160
% 0.15/0.50 # Removed by relevancy pruning/SinE : 0
% 0.15/0.50 # Initial clauses : 160
% 0.15/0.50 # Removed in clause preprocessing : 19
% 0.15/0.50 # Initial clauses in saturation : 141
% 0.15/0.50 # Processed clauses : 646
% 0.15/0.50 # ...of these trivial : 1
% 0.15/0.50 # ...subsumed : 106
% 0.15/0.50 # ...remaining for further processing : 539
% 0.15/0.50 # Other redundant clauses eliminated : 10
% 0.15/0.50 # Clauses deleted for lack of memory : 0
% 0.15/0.50 # Backward-subsumed : 30
% 0.15/0.50 # Backward-rewritten : 34
% 0.15/0.50 # Generated clauses : 1276
% 0.15/0.50 # ...of the previous two non-redundant : 1203
% 0.15/0.50 # ...aggressively subsumed : 0
% 0.15/0.50 # Contextual simplify-reflections : 5
% 0.15/0.50 # Paramodulations : 1262
% 0.15/0.50 # Factorizations : 4
% 0.15/0.50 # NegExts : 0
% 0.15/0.50 # Equation resolutions : 10
% 0.15/0.50 # Total rewrite steps : 271
% 0.15/0.50 # Propositional unsat checks : 0
% 0.15/0.50 # Propositional check models : 0
% 0.15/0.50 # Propositional check unsatisfiable : 0
% 0.15/0.50 # Propositional clauses : 0
% 0.15/0.50 # Propositional clauses after purity: 0
% 0.15/0.50 # Propositional unsat core size : 0
% 0.15/0.50 # Propositional preprocessing time : 0.000
% 0.15/0.50 # Propositional encoding time : 0.000
% 0.15/0.50 # Propositional solver time : 0.000
% 0.15/0.50 # Success case prop preproc time : 0.000
% 0.15/0.50 # Success case prop encoding time : 0.000
% 0.15/0.50 # Success case prop solver time : 0.000
% 0.15/0.50 # Current number of processed clauses : 329
% 0.15/0.50 # Positive orientable unit clauses : 38
% 0.15/0.50 # Positive unorientable unit clauses: 3
% 0.15/0.50 # Negative unit clauses : 0
% 0.15/0.50 # Non-unit-clauses : 288
% 0.15/0.50 # Current number of unprocessed clauses: 792
% 0.15/0.50 # ...number of literals in the above : 2568
% 0.15/0.50 # Current number of archived formulas : 0
% 0.15/0.50 # Current number of archived clauses : 223
% 0.15/0.50 # Clause-clause subsumption calls (NU) : 19590
% 0.15/0.50 # Rec. Clause-clause subsumption calls : 11696
% 0.15/0.50 # Non-unit clause-clause subsumptions : 131
% 0.15/0.50 # Unit Clause-clause subsumption calls : 342
% 0.15/0.50 # Rewrite failures with RHS unbound : 14
% 0.15/0.50 # BW rewrite match attempts : 26
% 0.15/0.50 # BW rewrite match successes : 13
% 0.15/0.50 # Condensation attempts : 0
% 0.15/0.50 # Condensation successes : 0
% 0.15/0.50 # Termbank termtop insertions : 45277
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.066 s
% 0.15/0.50 # System time : 0.004 s
% 0.15/0.50 # Total time : 0.070 s
% 0.15/0.50 # Maximum resident set size: 2208 pages
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.324 s
% 0.15/0.50 # System time : 0.009 s
% 0.15/0.50 # Total time : 0.333 s
% 0.15/0.50 # Maximum resident set size: 1812 pages
% 0.15/0.50 % E---3.1 exiting
% 0.15/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------