TSTP Solution File: SET144-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET144-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:53:23 EDT 2024
% Result : Unsatisfiable 4.65s 1.12s
% Output : CNFRefutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 6 unt; 4 nHn; 21 RR)
% Number of literals : 55 ( 7 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_commutativity_of_intersection_1,negated_conjecture,
intersection(x,y) != intersection(y,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutativity_of_intersection_1) ).
cnf(c_0_7,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_8,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_10,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_7 ).
cnf(c_0_11,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_8 ).
cnf(c_0_12,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_9 ).
cnf(c_0_13,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_14,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_15,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_14 ).
cnf(c_0_18,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_19,plain,
( subclass(intersection(X1,X2),intersection(X3,X1))
| ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
intersection(x,y) != intersection(y,x),
inference(fof_simplification,[status(thm)],[prove_commutativity_of_intersection_1]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_18 ).
cnf(c_0_23,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
intersection(x,y) != intersection(y,x),
c_0_21 ).
cnf(c_0_25,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),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.03/0.12 % Problem : SET144-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 12:25:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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
% 4.65/1.12 # Version: 3.1.0
% 4.65/1.12 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.65/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.65/1.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.65/1.12 # Starting new_bool_3 with 300s (1) cores
% 4.65/1.12 # Starting new_bool_1 with 300s (1) cores
% 4.65/1.12 # Starting sh5l with 300s (1) cores
% 4.65/1.12 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25100 completed with status 0
% 4.65/1.12 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.65/1.12 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.65/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.65/1.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.65/1.12 # No SInE strategy applied
% 4.65/1.12 # Search class: FGHSM-FFLM31-DFFFFFNN
% 4.65/1.12 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.65/1.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 4.65/1.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.65/1.12 # Starting new_bool_1 with 308s (1) cores
% 4.65/1.12 # Starting sh5l with 304s (1) cores
% 4.65/1.12 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.65/1.12 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25110 completed with status 0
% 4.65/1.12 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.65/1.12 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.65/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.65/1.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.65/1.12 # No SInE strategy applied
% 4.65/1.12 # Search class: FGHSM-FFLM31-DFFFFFNN
% 4.65/1.12 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.65/1.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 4.65/1.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.65/1.12 # Preprocessing time : 0.003 s
% 4.65/1.12 # Presaturation interreduction done
% 4.65/1.12
% 4.65/1.12 # Proof found!
% 4.65/1.12 # SZS status Unsatisfiable
% 4.65/1.12 # SZS output start CNFRefutation
% See solution above
% 4.65/1.12 # Parsed axioms : 113
% 4.65/1.12 # Removed by relevancy pruning/SinE : 0
% 4.65/1.12 # Initial clauses : 113
% 4.65/1.12 # Removed in clause preprocessing : 17
% 4.65/1.12 # Initial clauses in saturation : 96
% 4.65/1.12 # Processed clauses : 4643
% 4.65/1.12 # ...of these trivial : 121
% 4.65/1.12 # ...subsumed : 3161
% 4.65/1.12 # ...remaining for further processing : 1361
% 4.65/1.12 # Other redundant clauses eliminated : 18
% 4.65/1.12 # Clauses deleted for lack of memory : 0
% 4.65/1.12 # Backward-subsumed : 44
% 4.65/1.12 # Backward-rewritten : 364
% 4.65/1.12 # Generated clauses : 21550
% 4.65/1.12 # ...of the previous two non-redundant : 17992
% 4.65/1.12 # ...aggressively subsumed : 0
% 4.65/1.12 # Contextual simplify-reflections : 27
% 4.65/1.12 # Paramodulations : 21518
% 4.65/1.12 # Factorizations : 14
% 4.65/1.12 # NegExts : 0
% 4.65/1.12 # Equation resolutions : 18
% 4.65/1.12 # Disequality decompositions : 0
% 4.65/1.12 # Total rewrite steps : 7055
% 4.65/1.12 # ...of those cached : 6338
% 4.65/1.12 # Propositional unsat checks : 0
% 4.65/1.12 # Propositional check models : 0
% 4.65/1.12 # Propositional check unsatisfiable : 0
% 4.65/1.12 # Propositional clauses : 0
% 4.65/1.12 # Propositional clauses after purity: 0
% 4.65/1.12 # Propositional unsat core size : 0
% 4.65/1.12 # Propositional preprocessing time : 0.000
% 4.65/1.12 # Propositional encoding time : 0.000
% 4.65/1.12 # Propositional solver time : 0.000
% 4.65/1.12 # Success case prop preproc time : 0.000
% 4.65/1.12 # Success case prop encoding time : 0.000
% 4.65/1.12 # Success case prop solver time : 0.000
% 4.65/1.12 # Current number of processed clauses : 854
% 4.65/1.12 # Positive orientable unit clauses : 106
% 4.65/1.12 # Positive unorientable unit clauses: 1
% 4.65/1.12 # Negative unit clauses : 11
% 4.65/1.12 # Non-unit-clauses : 736
% 4.65/1.12 # Current number of unprocessed clauses: 13201
% 4.65/1.12 # ...number of literals in the above : 46935
% 4.65/1.12 # Current number of archived formulas : 0
% 4.65/1.12 # Current number of archived clauses : 520
% 4.65/1.12 # Clause-clause subsumption calls (NU) : 137214
% 4.65/1.12 # Rec. Clause-clause subsumption calls : 75580
% 4.65/1.12 # Non-unit clause-clause subsumptions : 2489
% 4.65/1.12 # Unit Clause-clause subsumption calls : 4777
% 4.65/1.12 # Rewrite failures with RHS unbound : 0
% 4.65/1.12 # BW rewrite match attempts : 508
% 4.65/1.12 # BW rewrite match successes : 385
% 4.65/1.12 # Condensation attempts : 0
% 4.65/1.12 # Condensation successes : 0
% 4.65/1.12 # Termbank termtop insertions : 828526
% 4.65/1.12 # Search garbage collected termcells : 185
% 4.65/1.12
% 4.65/1.12 # -------------------------------------------------
% 4.65/1.12 # User time : 0.579 s
% 4.65/1.12 # System time : 0.022 s
% 4.65/1.12 # Total time : 0.601 s
% 4.65/1.12 # Maximum resident set size: 2012 pages
% 4.65/1.12
% 4.65/1.12 # -------------------------------------------------
% 4.65/1.12 # User time : 2.895 s
% 4.65/1.12 # System time : 0.059 s
% 4.65/1.12 # Total time : 2.954 s
% 4.65/1.12 # Maximum resident set size: 1796 pages
% 4.65/1.12 % E---3.1 exiting
% 4.65/1.12 % E exiting
%------------------------------------------------------------------------------