TMTP Model File: SET777-1.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : ET---1.0
% Problem : SET777-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : do_ET %s
% Computer : n027.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16127.75MB
% OS : Linux 2.6.32-504.16.2.el6.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 12 20:19:29 EDT 2015
% Result : Satisfiable 0.03s
% Output : Saturation 0.03s
% Verified :
% Statistics : Number of clauses : 26 ( 35 expanded)
% Number of leaves : 6 ( 8 expanded)
% Depth : 5
% Number of atoms : 58 ( 75 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 3 ( 2 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: ET---1.0 format not known, defaulting to TPTP
cnf(c_0_0,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_axiom2)).
cnf(c_0_1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_axiom1)).
cnf(c_0_2,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',subsets_are_set_equal_sets)).
cnf(c_0_3,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',membership_in_subsets)).
cnf(c_0_4,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',set_equal_sets_are_subsets1)).
cnf(c_0_5,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax',set_equal_sets_are_subsets2)).
cnf(c_0_6,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_0).
cnf(c_0_7,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
c_0_1).
cnf(c_0_8,axiom,
( equal_sets(X2,X1)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_2).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_6).
cnf(c_0_10,plain,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
c_0_7).
cnf(c_0_11,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
c_0_3).
cnf(c_0_12,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_4).
cnf(c_0_13,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
c_0_5).
cnf(c_0_14,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_8).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_9,
[final]).
cnf(c_0_16,plain,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
c_0_10,
[final]).
cnf(c_0_17,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
c_0_11).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_12).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_13).
cnf(c_0_20,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_14,
[final]).
cnf(c_0_21,plain,
( subset(X1,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16,theory(equality)]),
[final]).
cnf(c_0_22,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
c_0_17,
[final]).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_18,
[final]).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_19,
[final]).
cnf(c_0_25,plain,
( equal_sets(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21,theory(equality)]),c_0_21,theory(equality)]),theory(equality,[symmetry])]),
[final]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET777-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : do_ET %s
% 0.02/1.06 % Computer : n027.star.cs.uiowa.edu
% 0.02/1.06 % Model : x86_64 x86_64
% 0.02/1.06 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.06 % Memory : 16127.75MB
% 0.02/1.06 % OS : Linux 2.6.32-504.16.2.el6.x86_64
% 0.02/1.06 % CPULimit : 300
% 0.02/1.06 % DateTime : Fri Jun 12 13:54:32 CDT 2015
% 0.02/1.06 % CPUTime :
% 0.03/1.11 # No SInE strategy applied
% 0.03/1.11 # Trying AutoSched4 for 18 seconds
% 0.03/1.12 # AutoSched4-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.03/1.12 # and selection function SelectNewComplexAHPNS.
% 0.03/1.12 #
% 0.03/1.12 # Preprocessing time : 0.005 s
% 0.03/1.12 # Presaturation interreduction done
% 0.03/1.12
% 0.03/1.12 # No proof found!
% 0.03/1.12 # SZS status Satisfiable
% 0.03/1.12 # SZS output start Saturation.
% 0.03/1.12 cnf(c_0_0,axiom,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax', subsets_axiom2)).
% 0.03/1.12 cnf(c_0_1,axiom,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax', subsets_axiom1)).
% 0.03/1.12 cnf(c_0_2,axiom,(equal_sets(X2,X1)|~subset(X1,X2)|~subset(X2,X1)), file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax', subsets_are_set_equal_sets)).
% 0.03/1.12 cnf(c_0_3,axiom,(member(X1,X3)|~member(X1,X2)|~subset(X2,X3)), file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax', membership_in_subsets)).
% 0.03/1.12 cnf(c_0_4,axiom,(subset(X1,X2)|~equal_sets(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax', set_equal_sets_are_subsets1)).
% 0.03/1.12 cnf(c_0_5,axiom,(subset(X2,X1)|~equal_sets(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/SET001-0.ax', set_equal_sets_are_subsets2)).
% 0.03/1.12 cnf(c_0_6,axiom,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), c_0_0).
% 0.03/1.12 cnf(c_0_7,axiom,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), c_0_1).
% 0.03/1.12 cnf(c_0_8,axiom,(equal_sets(X2,X1)|~subset(X2,X1)|~subset(X1,X2)), c_0_2).
% 0.03/1.12 cnf(c_0_9,plain,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), c_0_6).
% 0.03/1.12 cnf(c_0_10,plain,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), c_0_7).
% 0.03/1.12 cnf(c_0_11,axiom,(member(X1,X3)|~member(X1,X2)|~subset(X2,X3)), c_0_3).
% 0.03/1.12 cnf(c_0_12,axiom,(subset(X1,X2)|~equal_sets(X1,X2)), c_0_4).
% 0.03/1.12 cnf(c_0_13,axiom,(subset(X2,X1)|~equal_sets(X1,X2)), c_0_5).
% 0.03/1.12 cnf(c_0_14,plain,(equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1)), c_0_8).
% 0.03/1.12 cnf(c_0_15,plain,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), c_0_9, ['final']).
% 0.03/1.12 cnf(c_0_16,plain,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), c_0_10, ['final']).
% 0.03/1.12 cnf(c_0_17,plain,(member(X1,X2)|~subset(X3,X2)|~member(X1,X3)), c_0_11).
% 0.03/1.12 cnf(c_0_18,plain,(subset(X1,X2)|~equal_sets(X1,X2)), c_0_12).
% 0.03/1.12 cnf(c_0_19,plain,(subset(X1,X2)|~equal_sets(X2,X1)), c_0_13).
% 0.03/1.12 cnf(c_0_20,plain,(equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1)), c_0_14, ['final']).
% 0.03/1.12 cnf(c_0_21,plain,(subset(X1,X1)), inference(spm,[status(thm)],[c_0_15, c_0_16, theory(equality)]), ['final']).
% 0.03/1.12 cnf(c_0_22,plain,(member(X1,X2)|~subset(X3,X2)|~member(X1,X3)), c_0_17, ['final']).
% 0.03/1.12 cnf(c_0_23,plain,(subset(X1,X2)|~equal_sets(X1,X2)), c_0_18, ['final']).
% 0.03/1.12 cnf(c_0_24,plain,(subset(X1,X2)|~equal_sets(X2,X1)), c_0_19, ['final']).
% 0.03/1.12 cnf(c_0_25,plain,(equal_sets(X1,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21, theory(equality)]), c_0_21, theory(equality)]), theory(equality,[symmetry])]), ['final']).
% 0.03/1.12 # SZS output end Saturation.
% 0.03/1.12 # Parsed axioms : 6
% 0.03/1.12 # Removed by relevancy pruning/SinE : 0
% 0.03/1.12 # Initial clauses : 6
% 0.03/1.12 # Removed in clause preprocessing : 0
% 0.03/1.12 # Initial clauses in saturation : 6
% 0.03/1.12 # Processed clauses : 14
% 0.03/1.12 # ...of these trivial : 0
% 0.03/1.12 # ...subsumed : 0
% 0.03/1.12 # ...remaining for further processing : 14
% 0.03/1.12 # Other redundant clauses eliminated : 0
% 0.03/1.12 # Clauses deleted for lack of memory : 0
% 0.03/1.12 # Backward-subsumed : 0
% 0.03/1.12 # Backward-rewritten : 0
% 0.03/1.12 # Generated clauses : 5
% 0.03/1.12 # ...of the previous two non-trivial : 2
% 0.03/1.12 # Contextual simplify-reflections : 0
% 0.03/1.12 # Paramodulations : 5
% 0.03/1.12 # Factorizations : 0
% 0.03/1.12 # Equation resolutions : 0
% 0.03/1.12 # Current number of processed clauses : 8
% 0.03/1.12 # Positive orientable unit clauses : 2
% 0.03/1.12 # Positive unorientable unit clauses: 0
% 0.03/1.12 # Negative unit clauses : 0
% 0.03/1.12 # Non-unit-clauses : 6
% 0.03/1.12 # Current number of unprocessed clauses: 0
% 0.03/1.12 # ...number of literals in the above : 0
% 0.03/1.12 # Clause-clause subsumption calls (NU) : 6
% 0.03/1.12 # Rec. Clause-clause subsumption calls : 6
% 0.03/1.12 # Non-unit clause-clause subsumptions : 0
% 0.03/1.12 # Unit Clause-clause subsumption calls : 5
% 0.03/1.12 # Rewrite failures with RHS unbound : 0
% 0.03/1.12 # BW rewrite match attempts : 5
% 0.03/1.12 # BW rewrite match successes : 0
% 0.03/1.12 # Condensation attempts : 0
% 0.03/1.12 # Condensation successes : 0
% 0.03/1.12
% 0.03/1.12 # -------------------------------------------------
% 0.03/1.12 # User time : 0.006 s
% 0.03/1.12 # System time : 0.000 s
% 0.03/1.12 # Total time : 0.006 s
% 0.03/1.12 # Maximum resident set size: 2500 pages
% 0.03/1.12
% 0.03/1.12 # -------------------------------------------------
% 0.03/1.12 # User time : 0.024 s
% 0.03/1.12 # System time : 0.008 s
% 0.03/1.12 # Total time : 0.032 s
% 0.03/1.12 # Maximum resident set size: 4012 pages
% 0.03/1.12 0.02user 0.00system 0:00.03elapsed 90%CPU (0avgtext+0avgdata 16048maxresident)k
% 0.03/1.12 0inputs+936outputs (0major+2899minor)pagefaults 0swaps
%------------------------------------------------------------------------------