TSTP Solution File: BOO021-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO021-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:18:33 EDT 2023
% Result : Unsatisfiable 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 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; 2 con; 0-2 aty)
% Number of variables : 17 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(add_multiply,axiom,
add(multiply(X1,X2),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.HSwamzFoOW/E---3.1_18662.p',add_multiply) ).
cnf(multiply_add,axiom,
multiply(add(X1,X2),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.HSwamzFoOW/E---3.1_18662.p',multiply_add) ).
cnf(multiply_add_property,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
file('/export/starexec/sandbox/tmp/tmp.HSwamzFoOW/E---3.1_18662.p',multiply_add_property) ).
cnf(prove_commutativity_of_multiply,negated_conjecture,
multiply(b,a) != multiply(a,b),
file('/export/starexec/sandbox/tmp/tmp.HSwamzFoOW/E---3.1_18662.p',prove_commutativity_of_multiply) ).
cnf(c_0_4,axiom,
add(multiply(X1,X2),X2) = X2,
add_multiply ).
cnf(c_0_5,axiom,
multiply(add(X1,X2),X2) = X2,
multiply_add ).
cnf(c_0_6,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
multiply_add_property ).
cnf(c_0_7,plain,
add(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
multiply(b,a) != multiply(a,b),
prove_commutativity_of_multiply ).
cnf(c_0_9,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.09 % Problem : BOO021-1 : TPTP v8.1.2. Released v2.2.0.
% 0.01/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n009.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 : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 20:33:14 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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/tmp/tmp.HSwamzFoOW/E---3.1_18662.p
% 0.14/0.40 # Version: 3.1pre001
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # new_bool_3 with pid 18740 completed with status 0
% 0.14/0.40 # Result found by new_bool_3
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.40 # SAT001_MinMin_p005000_rr_RG with pid 18744 completed with status 0
% 0.14/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Unsatisfiable
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 7
% 0.14/0.40 # Removed by relevancy pruning/SinE : 2
% 0.14/0.40 # Initial clauses : 5
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 5
% 0.14/0.40 # Processed clauses : 14
% 0.14/0.40 # ...of these trivial : 1
% 0.14/0.40 # ...subsumed : 0
% 0.14/0.40 # ...remaining for further processing : 13
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 2
% 0.14/0.40 # Generated clauses : 30
% 0.14/0.40 # ...of the previous two non-redundant : 20
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 30
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Total rewrite steps : 10
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 6
% 0.14/0.40 # Positive orientable unit clauses : 5
% 0.14/0.40 # Positive unorientable unit clauses: 1
% 0.14/0.40 # Negative unit clauses : 0
% 0.14/0.40 # Non-unit-clauses : 0
% 0.14/0.40 # Current number of unprocessed clauses: 15
% 0.14/0.40 # ...number of literals in the above : 15
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 7
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.40 # Non-unit clause-clause subsumptions : 0
% 0.14/0.40 # Unit Clause-clause subsumption calls : 2
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 32
% 0.14/0.40 # BW rewrite match successes : 18
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 269
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.003 s
% 0.14/0.40 # System time : 0.000 s
% 0.14/0.40 # Total time : 0.003 s
% 0.14/0.40 # Maximum resident set size: 1424 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.004 s
% 0.14/0.40 # System time : 0.001 s
% 0.14/0.40 # Total time : 0.005 s
% 0.14/0.40 # Maximum resident set size: 1684 pages
% 0.14/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------