TSTP Solution File: GRP146-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP146-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Sat May 4 07:57:38 EDT 2024
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 15 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ax_lub1a,negated_conjecture,
least_upper_bound(least_upper_bound(a,b),c) != c,
file('/export/starexec/sandbox2/tmp/tmp.wZ0PUG0Wdb/E---3.1_13419.p',prove_ax_lub1a) ).
cnf(ax_lub1a_1,hypothesis,
least_upper_bound(a,c) = c,
file('/export/starexec/sandbox2/tmp/tmp.wZ0PUG0Wdb/E---3.1_13419.p',ax_lub1a_1) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.wZ0PUG0Wdb/E---3.1_13419.p',symmetry_of_lub) ).
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/tmp/tmp.wZ0PUG0Wdb/E---3.1_13419.p',associativity_of_lub) ).
cnf(ax_lub1a_2,hypothesis,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox2/tmp/tmp.wZ0PUG0Wdb/E---3.1_13419.p',ax_lub1a_2) ).
cnf(c_0_5,negated_conjecture,
least_upper_bound(least_upper_bound(a,b),c) != c,
inference(fof_simplification,[status(thm)],[prove_ax_lub1a]) ).
cnf(c_0_6,hypothesis,
least_upper_bound(a,c) = c,
ax_lub1a_1 ).
cnf(c_0_7,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_8,negated_conjecture,
least_upper_bound(least_upper_bound(a,b),c) != c,
c_0_5 ).
cnf(c_0_9,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_10,hypothesis,
least_upper_bound(c,a) = c,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,hypothesis,
least_upper_bound(b,c) = c,
ax_lub1a_2 ).
cnf(c_0_12,negated_conjecture,
least_upper_bound(c,least_upper_bound(a,b)) != c,
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,hypothesis,
least_upper_bound(c,least_upper_bound(a,X1)) = least_upper_bound(c,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
least_upper_bound(c,b) = c,
inference(rw,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP146-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 16:07:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 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/tmp/tmp.wZ0PUG0Wdb/E---3.1_13419.p
% 0.18/0.46 # Version: 3.1.0
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 13497 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # SAT001_MinMin_p005000_rr_RG with pid 13501 completed with status 0
% 0.18/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Unsatisfiable
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 18
% 0.18/0.46 # Removed by relevancy pruning/SinE : 2
% 0.18/0.46 # Initial clauses : 16
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 16
% 0.18/0.46 # Processed clauses : 38
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 0
% 0.18/0.46 # ...remaining for further processing : 38
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 4
% 0.18/0.46 # Generated clauses : 80
% 0.18/0.46 # ...of the previous two non-redundant : 51
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 80
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 58
% 0.18/0.46 # ...of those cached : 17
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 18
% 0.18/0.46 # Positive orientable unit clauses : 16
% 0.18/0.46 # Positive unorientable unit clauses: 2
% 0.18/0.46 # Negative unit clauses : 0
% 0.18/0.46 # Non-unit-clauses : 0
% 0.18/0.46 # Current number of unprocessed clauses: 45
% 0.18/0.46 # ...number of literals in the above : 45
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 20
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.46 # Non-unit clause-clause subsumptions : 0
% 0.18/0.46 # Unit Clause-clause subsumption calls : 1
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 43
% 0.18/0.46 # BW rewrite match successes : 33
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 791
% 0.18/0.46 # Search garbage collected termcells : 8
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.001 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.004 s
% 0.18/0.46 # Maximum resident set size: 1628 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.001 s
% 0.18/0.46 # System time : 0.006 s
% 0.18/0.46 # Total time : 0.007 s
% 0.18/0.46 # Maximum resident set size: 1688 pages
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------