TSTP Solution File: SET245-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET245-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:22:32 EDT 2023
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 14 unt; 4 nHn; 14 RR)
% Number of literals : 42 ( 17 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 46 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',class_elements_are_sets) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',intersection2) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',complement1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',restriction2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',restriction1) ).
cnf(prove_restriction_with_null_class1_1,negated_conjecture,
restrict(null_class,x,y) != null_class,
file('/export/starexec/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p',prove_restriction_with_null_class1_1) ).
cnf(c_0_8,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_9,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_10,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_11,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_12,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_13,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_17,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_18,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_19,plain,
( intersection(X1,complement(X2)) = null_class
| ~ member(regular(intersection(X1,complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
restrict(null_class,x,y) != null_class,
prove_restriction_with_null_class1_1 ).
cnf(c_0_22,plain,
intersection(X1,cross_product(X2,X3)) = intersection(cross_product(X2,X3),X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
intersection(X1,null_class) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
intersection(null_class,cross_product(x,y)) != null_class,
inference(rw,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_25,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SET245-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 17:38:42 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.rilQs50AZS/E---3.1_18431.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # sh5l with pid 18511 completed with status 0
% 0.14/0.43 # Result found by sh5l
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/0.43 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.14/0.43 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 18514 completed with status 0
% 0.14/0.43 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/0.43 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.14/0.43 # Preprocessing time : 0.002 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Unsatisfiable
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 113
% 0.14/0.43 # Removed by relevancy pruning/SinE : 14
% 0.14/0.43 # Initial clauses : 99
% 0.14/0.43 # Removed in clause preprocessing : 0
% 0.14/0.43 # Initial clauses in saturation : 99
% 0.14/0.43 # Processed clauses : 271
% 0.14/0.43 # ...of these trivial : 1
% 0.14/0.43 # ...subsumed : 6
% 0.14/0.43 # ...remaining for further processing : 264
% 0.14/0.43 # Other redundant clauses eliminated : 2
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 1
% 0.14/0.43 # Backward-rewritten : 5
% 0.14/0.43 # Generated clauses : 528
% 0.14/0.43 # ...of the previous two non-redundant : 490
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 0
% 0.14/0.43 # Paramodulations : 524
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 4
% 0.14/0.43 # Total rewrite steps : 54
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 158
% 0.14/0.43 # Positive orientable unit clauses : 54
% 0.14/0.43 # Positive unorientable unit clauses: 1
% 0.14/0.43 # Negative unit clauses : 0
% 0.14/0.43 # Non-unit-clauses : 103
% 0.14/0.43 # Current number of unprocessed clauses: 416
% 0.14/0.43 # ...number of literals in the above : 888
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 104
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 2649
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 2326
% 0.14/0.43 # Non-unit clause-clause subsumptions : 7
% 0.14/0.43 # Unit Clause-clause subsumption calls : 437
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 32
% 0.14/0.43 # BW rewrite match successes : 10
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 10152
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.017 s
% 0.14/0.43 # System time : 0.004 s
% 0.14/0.43 # Total time : 0.022 s
% 0.14/0.43 # Maximum resident set size: 1956 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.019 s
% 0.14/0.43 # System time : 0.007 s
% 0.14/0.43 # Total time : 0.026 s
% 0.14/0.43 # Maximum resident set size: 1772 pages
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------