TSTP Solution File: GRP176-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:46:29 EDT 2023
% Result : Unsatisfiable 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 3 RR)
% Number of literals : 7 ( 6 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_p07,negated_conjecture,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
file('/export/starexec/sandbox2/tmp/tmp.Vwytlg7eM8/E---3.1_21435.p',prove_p07) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.Vwytlg7eM8/E---3.1_21435.p',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.Vwytlg7eM8/E---3.1_21435.p',monotony_lub2) ).
cnf(c_0_3,negated_conjecture,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
prove_p07 ).
cnf(c_0_4,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_5,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n001.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 03:12:07 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.39 Running first-order model finding
% 0.15/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/tmp/tmp.Vwytlg7eM8/E---3.1_21435.p
% 0.15/0.40 # Version: 3.1pre001
% 0.15/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # new_bool_1 with pid 21514 completed with status 0
% 0.15/0.40 # Result found by new_bool_1
% 0.15/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.40 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.40 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.15/0.40 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 21519 completed with status 0
% 0.15/0.40 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.15/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.40 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.40 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Unsatisfiable
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 16
% 0.15/0.40 # Removed by relevancy pruning/SinE : 2
% 0.15/0.40 # Initial clauses : 14
% 0.15/0.40 # Removed in clause preprocessing : 0
% 0.15/0.40 # Initial clauses in saturation : 14
% 0.15/0.40 # Processed clauses : 14
% 0.15/0.40 # ...of these trivial : 0
% 0.15/0.40 # ...subsumed : 0
% 0.15/0.40 # ...remaining for further processing : 13
% 0.15/0.40 # Other redundant clauses eliminated : 0
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 0
% 0.15/0.40 # Backward-rewritten : 0
% 0.15/0.40 # Generated clauses : 0
% 0.15/0.40 # ...of the previous two non-redundant : 0
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 0
% 0.15/0.40 # Paramodulations : 0
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 0
% 0.15/0.40 # Total rewrite steps : 2
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 13
% 0.15/0.40 # Positive orientable unit clauses : 11
% 0.15/0.40 # Positive unorientable unit clauses: 2
% 0.15/0.40 # Negative unit clauses : 0
% 0.15/0.40 # Non-unit-clauses : 0
% 0.15/0.40 # Current number of unprocessed clauses: 0
% 0.15/0.40 # ...number of literals in the above : 0
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 0
% 0.15/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.40 # Non-unit clause-clause subsumptions : 0
% 0.15/0.40 # Unit Clause-clause subsumption calls : 0
% 0.15/0.40 # Rewrite failures with RHS unbound : 0
% 0.15/0.40 # BW rewrite match attempts : 10
% 0.15/0.40 # BW rewrite match successes : 8
% 0.15/0.40 # Condensation attempts : 0
% 0.15/0.40 # Condensation successes : 0
% 0.15/0.40 # Termbank termtop insertions : 232
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.001 s
% 0.15/0.40 # System time : 0.001 s
% 0.15/0.40 # Total time : 0.002 s
% 0.15/0.40 # Maximum resident set size: 1620 pages
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.003 s
% 0.15/0.40 # System time : 0.002 s
% 0.15/0.40 # Total time : 0.005 s
% 0.15/0.40 # Maximum resident set size: 1676 pages
% 0.15/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------