TSTP Solution File: SET031-4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET031-4 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:57:06 EDT 2024
% Result : Unsatisfiable 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 5 unt; 2 nHn; 20 RR)
% Number of literals : 47 ( 6 equ; 25 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 46 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair_predicate4,axiom,
( ordered_pair_predicate(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate4) ).
cnf(compose4,axiom,
( X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose4) ).
cnf(compose1,axiom,
( little_set(f29(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose1) ).
cnf(compose2,axiom,
( little_set(f30(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose2) ).
cnf(relation3,axiom,
( relation(X1)
| ~ ordered_pair_predicate(f18(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',relation3) ).
cnf(prove_composition_is_a_relation,negated_conjecture,
~ relation(compose(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_composition_is_a_relation) ).
cnf(relation2,axiom,
( relation(X1)
| member(f18(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',relation2) ).
cnf(c_0_7,plain,
( ordered_pair_predicate(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3) ),
inference(fof_simplification,[status(thm)],[ordered_pair_predicate4]) ).
cnf(c_0_8,plain,
( X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
inference(fof_simplification,[status(thm)],[compose4]) ).
cnf(c_0_9,plain,
( little_set(f29(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
inference(fof_simplification,[status(thm)],[compose1]) ).
cnf(c_0_10,plain,
( little_set(f30(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
inference(fof_simplification,[status(thm)],[compose2]) ).
cnf(c_0_11,plain,
( ordered_pair_predicate(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3) ),
c_0_7 ).
cnf(c_0_12,plain,
( X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
c_0_8 ).
cnf(c_0_13,plain,
( little_set(f29(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
c_0_9 ).
cnf(c_0_14,plain,
( little_set(f30(X1,X2,X3))
| ~ member(X1,compose(X2,X3)) ),
c_0_10 ).
cnf(c_0_15,plain,
( relation(X1)
| ~ ordered_pair_predicate(f18(X1)) ),
inference(fof_simplification,[status(thm)],[relation3]) ).
cnf(c_0_16,negated_conjecture,
~ relation(compose(a,b)),
inference(fof_simplification,[status(thm)],[prove_composition_is_a_relation]) ).
cnf(c_0_17,plain,
( ordered_pair_predicate(X1)
| ~ member(X1,compose(X2,X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),c_0_14]) ).
cnf(c_0_18,axiom,
( relation(X1)
| member(f18(X1),X1) ),
relation2 ).
cnf(c_0_19,plain,
( relation(X1)
| ~ ordered_pair_predicate(f18(X1)) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
~ relation(compose(a,b)),
c_0_16 ).
cnf(c_0_21,plain,
relation(compose(X1,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET031-4 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 11:28:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.15/0.38 Running first-order model finding
% 0.15/0.38 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.49 # Version: 3.1.0
% 0.15/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 # Starting sh5l with 300s (1) cores
% 0.15/0.49 # sh5l with pid 11324 completed with status 0
% 0.15/0.49 # Result found by sh5l
% 0.15/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 # Starting sh5l with 300s (1) cores
% 0.15/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.49 # Search class: FGHSF-FFMF31-MFFFFFNN
% 0.15/0.49 # partial match(1): FGHSF-FFMF31-SFFFFFNN
% 0.15/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 152s (1) cores
% 0.15/0.49 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 11327 completed with status 0
% 0.15/0.49 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.15/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 # Starting sh5l with 300s (1) cores
% 0.15/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.49 # Search class: FGHSF-FFMF31-MFFFFFNN
% 0.15/0.49 # partial match(1): FGHSF-FFMF31-SFFFFFNN
% 0.15/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 152s (1) cores
% 0.15/0.49 # Preprocessing time : 0.003 s
% 0.15/0.49 # Presaturation interreduction done
% 0.15/0.49
% 0.15/0.49 # Proof found!
% 0.15/0.49 # SZS status Unsatisfiable
% 0.15/0.49 # SZS output start CNFRefutation
% See solution above
% 0.15/0.49 # Parsed axioms : 142
% 0.15/0.49 # Removed by relevancy pruning/SinE : 44
% 0.15/0.49 # Initial clauses : 98
% 0.15/0.49 # Removed in clause preprocessing : 0
% 0.15/0.49 # Initial clauses in saturation : 98
% 0.15/0.49 # Processed clauses : 689
% 0.15/0.49 # ...of these trivial : 3
% 0.15/0.49 # ...subsumed : 229
% 0.15/0.49 # ...remaining for further processing : 457
% 0.15/0.49 # Other redundant clauses eliminated : 25
% 0.15/0.49 # Clauses deleted for lack of memory : 0
% 0.15/0.49 # Backward-subsumed : 2
% 0.15/0.49 # Backward-rewritten : 29
% 0.15/0.49 # Generated clauses : 2181
% 0.15/0.49 # ...of the previous two non-redundant : 1844
% 0.15/0.49 # ...aggressively subsumed : 0
% 0.15/0.49 # Contextual simplify-reflections : 20
% 0.15/0.49 # Paramodulations : 2142
% 0.15/0.49 # Factorizations : 0
% 0.15/0.49 # NegExts : 0
% 0.15/0.49 # Equation resolutions : 39
% 0.15/0.49 # Disequality decompositions : 0
% 0.15/0.49 # Total rewrite steps : 654
% 0.15/0.49 # ...of those cached : 586
% 0.15/0.49 # Propositional unsat checks : 0
% 0.15/0.49 # Propositional check models : 0
% 0.15/0.49 # Propositional check unsatisfiable : 0
% 0.15/0.49 # Propositional clauses : 0
% 0.15/0.49 # Propositional clauses after purity: 0
% 0.15/0.49 # Propositional unsat core size : 0
% 0.15/0.49 # Propositional preprocessing time : 0.000
% 0.15/0.49 # Propositional encoding time : 0.000
% 0.15/0.49 # Propositional solver time : 0.000
% 0.15/0.49 # Success case prop preproc time : 0.000
% 0.15/0.49 # Success case prop encoding time : 0.000
% 0.15/0.49 # Success case prop solver time : 0.000
% 0.15/0.49 # Current number of processed clauses : 327
% 0.15/0.49 # Positive orientable unit clauses : 26
% 0.15/0.49 # Positive unorientable unit clauses: 0
% 0.15/0.49 # Negative unit clauses : 3
% 0.15/0.49 # Non-unit-clauses : 298
% 0.15/0.49 # Current number of unprocessed clauses: 1159
% 0.15/0.49 # ...number of literals in the above : 4422
% 0.15/0.49 # Current number of archived formulas : 0
% 0.15/0.49 # Current number of archived clauses : 129
% 0.15/0.49 # Clause-clause subsumption calls (NU) : 28719
% 0.15/0.49 # Rec. Clause-clause subsumption calls : 10585
% 0.15/0.49 # Non-unit clause-clause subsumptions : 106
% 0.15/0.49 # Unit Clause-clause subsumption calls : 4218
% 0.15/0.49 # Rewrite failures with RHS unbound : 0
% 0.15/0.49 # BW rewrite match attempts : 30
% 0.15/0.49 # BW rewrite match successes : 24
% 0.15/0.49 # Condensation attempts : 0
% 0.15/0.49 # Condensation successes : 0
% 0.15/0.49 # Termbank termtop insertions : 36246
% 0.15/0.49 # Search garbage collected termcells : 425
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.076 s
% 0.15/0.49 # System time : 0.006 s
% 0.15/0.49 # Total time : 0.082 s
% 0.15/0.49 # Maximum resident set size: 2040 pages
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.078 s
% 0.15/0.49 # System time : 0.008 s
% 0.15/0.49 # Total time : 0.086 s
% 0.15/0.49 # Maximum resident set size: 1828 pages
% 0.15/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------