TSTP Solution File: SET025-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET025-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:52:33 EDT 2024
% Result : Unsatisfiable 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 5 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ordered_pairs_are_small,negated_conjecture,
~ little_set(ordered_pair(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordered_pairs_are_small) ).
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',singleton_set) ).
cnf(non_ordered_pair4,axiom,
little_set(non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).
cnf(c_0_4,negated_conjecture,
~ little_set(ordered_pair(a,b)),
inference(fof_simplification,[status(thm)],[prove_ordered_pairs_are_small]) ).
cnf(c_0_5,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_6,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_7,negated_conjecture,
~ little_set(ordered_pair(a,b)),
c_0_4 ).
cnf(c_0_8,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ little_set(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
little_set(non_ordered_pair(X1,X2)),
non_ordered_pair4 ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET025-3 : TPTP v8.2.0. Released v1.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n020.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 : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 12:39:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/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/benchmark/theBenchmark.p
% 0.17/0.43 # Version: 3.1.0
% 0.17/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 778 completed with status 0
% 0.17/0.43 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.17/0.43 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.17/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.43 # Starting new_bool_3 with 216s (1) cores
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.17/0.43 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 784 completed with status 0
% 0.17/0.43 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.17/0.43 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.17/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.43 # Preprocessing time : 0.002 s
% 0.17/0.43 # Presaturation interreduction done
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Unsatisfiable
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 151
% 0.17/0.43 # Removed by relevancy pruning/SinE : 0
% 0.17/0.43 # Initial clauses : 151
% 0.17/0.43 # Removed in clause preprocessing : 6
% 0.17/0.43 # Initial clauses in saturation : 145
% 0.17/0.43 # Processed clauses : 5
% 0.17/0.43 # ...of these trivial : 0
% 0.17/0.43 # ...subsumed : 0
% 0.17/0.43 # ...remaining for further processing : 5
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 1
% 0.17/0.43 # Generated clauses : 0
% 0.17/0.43 # ...of the previous two non-redundant : 0
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 0
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Disequality decompositions : 0
% 0.17/0.43 # Total rewrite steps : 1
% 0.17/0.43 # ...of those cached : 0
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 4
% 0.17/0.43 # Positive orientable unit clauses : 3
% 0.17/0.43 # Positive unorientable unit clauses: 0
% 0.17/0.43 # Negative unit clauses : 1
% 0.17/0.43 # Non-unit-clauses : 0
% 0.17/0.43 # Current number of unprocessed clauses: 140
% 0.17/0.43 # ...number of literals in the above : 374
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 7
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 0
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 1
% 0.17/0.43 # BW rewrite match successes : 1
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 3842
% 0.17/0.43 # Search garbage collected termcells : 342
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.005 s
% 0.17/0.43 # System time : 0.003 s
% 0.17/0.43 # Total time : 0.008 s
% 0.17/0.43 # Maximum resident set size: 2088 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.020 s
% 0.17/0.43 # System time : 0.008 s
% 0.17/0.43 # Total time : 0.028 s
% 0.17/0.43 # Maximum resident set size: 1832 pages
% 0.17/0.43 % E---3.1 exiting
% 0.17/0.44 % E exiting
%------------------------------------------------------------------------------