TSTP Solution File: GRP150-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP150-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Mon May 20 20:54:30 EDT 2024
% Result : Unsatisfiable 0.16s 0.40s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 8 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ax_lub2a,negated_conjecture,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub2a) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(idempotence_of_lub,axiom,
least_upper_bound(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
cnf(c_0_3,negated_conjecture,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(fof_simplification,[status(thm)],[prove_ax_lub2a]) ).
cnf(c_0_4,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_5,axiom,
least_upper_bound(X1,X1) = X1,
idempotence_of_lub ).
cnf(c_0_6,negated_conjecture,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
c_0_3 ).
cnf(c_0_7,plain,
least_upper_bound(X1,least_upper_bound(X1,X2)) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP150-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n014.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.15/0.31 % CPULimit : 300
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Sun May 19 05:44:38 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.16/0.39 Running first-order model finding
% 0.16/0.39 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/benchmark/theBenchmark.p
% 0.16/0.40 # Version: 3.1.0
% 0.16/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.40 # Starting sh5l with 300s (1) cores
% 0.16/0.40 # new_bool_3 with pid 25273 completed with status 0
% 0.16/0.40 # Result found by new_bool_3
% 0.16/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.40 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.16/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.40 # SAT001_MinMin_p005000_rr_RG with pid 25279 completed with status 0
% 0.16/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.40 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.16/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.40 # Preprocessing time : 0.001 s
% 0.16/0.40 # Presaturation interreduction done
% 0.16/0.40
% 0.16/0.40 # Proof found!
% 0.16/0.40 # SZS status Unsatisfiable
% 0.16/0.40 # SZS output start CNFRefutation
% See solution above
% 0.16/0.40 # Parsed axioms : 16
% 0.16/0.40 # Removed by relevancy pruning/SinE : 2
% 0.16/0.40 # Initial clauses : 14
% 0.16/0.40 # Removed in clause preprocessing : 0
% 0.16/0.40 # Initial clauses in saturation : 14
% 0.16/0.40 # Processed clauses : 24
% 0.16/0.40 # ...of these trivial : 0
% 0.16/0.40 # ...subsumed : 0
% 0.16/0.40 # ...remaining for further processing : 24
% 0.16/0.40 # Other redundant clauses eliminated : 0
% 0.16/0.40 # Clauses deleted for lack of memory : 0
% 0.16/0.40 # Backward-subsumed : 0
% 0.16/0.40 # Backward-rewritten : 1
% 0.16/0.40 # Generated clauses : 41
% 0.16/0.40 # ...of the previous two non-redundant : 22
% 0.16/0.40 # ...aggressively subsumed : 0
% 0.16/0.40 # Contextual simplify-reflections : 0
% 0.16/0.40 # Paramodulations : 41
% 0.16/0.40 # Factorizations : 0
% 0.16/0.40 # NegExts : 0
% 0.16/0.40 # Equation resolutions : 0
% 0.16/0.40 # Disequality decompositions : 0
% 0.16/0.40 # Total rewrite steps : 19
% 0.16/0.40 # ...of those cached : 8
% 0.16/0.40 # Propositional unsat checks : 0
% 0.16/0.40 # Propositional check models : 0
% 0.16/0.40 # Propositional check unsatisfiable : 0
% 0.16/0.40 # Propositional clauses : 0
% 0.16/0.40 # Propositional clauses after purity: 0
% 0.16/0.40 # Propositional unsat core size : 0
% 0.16/0.40 # Propositional preprocessing time : 0.000
% 0.16/0.40 # Propositional encoding time : 0.000
% 0.16/0.40 # Propositional solver time : 0.000
% 0.16/0.40 # Success case prop preproc time : 0.000
% 0.16/0.40 # Success case prop encoding time : 0.000
% 0.16/0.40 # Success case prop solver time : 0.000
% 0.16/0.40 # Current number of processed clauses : 9
% 0.16/0.40 # Positive orientable unit clauses : 7
% 0.16/0.40 # Positive unorientable unit clauses: 2
% 0.16/0.40 # Negative unit clauses : 0
% 0.16/0.40 # Non-unit-clauses : 0
% 0.16/0.40 # Current number of unprocessed clauses: 26
% 0.16/0.40 # ...number of literals in the above : 26
% 0.16/0.40 # Current number of archived formulas : 0
% 0.16/0.40 # Current number of archived clauses : 15
% 0.16/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.40 # Non-unit clause-clause subsumptions : 0
% 0.16/0.40 # Unit Clause-clause subsumption calls : 0
% 0.16/0.40 # Rewrite failures with RHS unbound : 0
% 0.16/0.40 # BW rewrite match attempts : 28
% 0.16/0.40 # BW rewrite match successes : 23
% 0.16/0.40 # Condensation attempts : 0
% 0.16/0.40 # Condensation successes : 0
% 0.16/0.40 # Termbank termtop insertions : 424
% 0.16/0.40 # Search garbage collected termcells : 8
% 0.16/0.40
% 0.16/0.40 # -------------------------------------------------
% 0.16/0.40 # User time : 0.002 s
% 0.16/0.40 # System time : 0.001 s
% 0.16/0.40 # Total time : 0.003 s
% 0.16/0.40 # Maximum resident set size: 1620 pages
% 0.16/0.40
% 0.16/0.40 # -------------------------------------------------
% 0.16/0.40 # User time : 0.002 s
% 0.16/0.40 # System time : 0.002 s
% 0.16/0.40 # Total time : 0.004 s
% 0.16/0.40 # Maximum resident set size: 1696 pages
% 0.16/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------