TSTP Solution File: GRP001-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP001-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:43:24 EDT 2023
% Result : Unsatisfiable 0.35s 0.53s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.uMzRVwIwzE/E---3.1_13298.p',associativity) ).
cnf(squareness,hypothesis,
multiply(X1,X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.uMzRVwIwzE/E---3.1_13298.p',squareness) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.uMzRVwIwzE/E---3.1_13298.p',left_identity) ).
cnf(a_times_b_is_c,hypothesis,
multiply(a,b) = c,
file('/export/starexec/sandbox/tmp/tmp.uMzRVwIwzE/E---3.1_13298.p',a_times_b_is_c) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.uMzRVwIwzE/E---3.1_13298.p',right_identity) ).
cnf(prove_b_times_a_is_c,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox/tmp/tmp.uMzRVwIwzE/E---3.1_13298.p',prove_b_times_a_is_c) ).
cnf(c_0_6,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_7,hypothesis,
multiply(X1,X1) = identity,
squareness ).
cnf(c_0_8,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_9,hypothesis,
multiply(a,b) = c,
a_times_b_is_c ).
cnf(c_0_10,hypothesis,
multiply(X1,multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,hypothesis,
multiply(X1,multiply(X2,multiply(X1,X2))) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_12,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_13,hypothesis,
multiply(a,multiply(b,X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,hypothesis,
multiply(X1,multiply(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,hypothesis,
multiply(c,b) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_7]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
multiply(b,a) != c,
prove_b_times_a_is_c ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:31:16 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 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.uMzRVwIwzE/E---3.1_13298.p
% 0.35/0.53 # Version: 3.1pre001
% 0.35/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.53 # Starting sh5l with 300s (1) cores
% 0.35/0.53 # new_bool_3 with pid 13376 completed with status 0
% 0.35/0.53 # Result found by new_bool_3
% 0.35/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/0.53 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.35/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.35/0.53 # SAT001_MinMin_p005000_rr_RG with pid 13384 completed with status 0
% 0.35/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.35/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/0.53 # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.35/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.35/0.53 # Preprocessing time : 0.001 s
% 0.35/0.53 # Presaturation interreduction done
% 0.35/0.53
% 0.35/0.53 # Proof found!
% 0.35/0.53 # SZS status Unsatisfiable
% 0.35/0.53 # SZS output start CNFRefutation
% See solution above
% 0.35/0.53 # Parsed axioms : 8
% 0.35/0.53 # Removed by relevancy pruning/SinE : 2
% 0.35/0.53 # Initial clauses : 6
% 0.35/0.53 # Removed in clause preprocessing : 0
% 0.35/0.53 # Initial clauses in saturation : 6
% 0.35/0.53 # Processed clauses : 20
% 0.35/0.53 # ...of these trivial : 0
% 0.35/0.53 # ...subsumed : 0
% 0.35/0.53 # ...remaining for further processing : 20
% 0.35/0.53 # Other redundant clauses eliminated : 0
% 0.35/0.53 # Clauses deleted for lack of memory : 0
% 0.35/0.53 # Backward-subsumed : 0
% 0.35/0.53 # Backward-rewritten : 1
% 0.35/0.53 # Generated clauses : 77
% 0.35/0.53 # ...of the previous two non-redundant : 27
% 0.35/0.53 # ...aggressively subsumed : 0
% 0.35/0.53 # Contextual simplify-reflections : 0
% 0.35/0.53 # Paramodulations : 77
% 0.35/0.53 # Factorizations : 0
% 0.35/0.53 # NegExts : 0
% 0.35/0.53 # Equation resolutions : 0
% 0.35/0.53 # Total rewrite steps : 84
% 0.35/0.53 # Propositional unsat checks : 0
% 0.35/0.53 # Propositional check models : 0
% 0.35/0.53 # Propositional check unsatisfiable : 0
% 0.35/0.53 # Propositional clauses : 0
% 0.35/0.53 # Propositional clauses after purity: 0
% 0.35/0.53 # Propositional unsat core size : 0
% 0.35/0.53 # Propositional preprocessing time : 0.000
% 0.35/0.53 # Propositional encoding time : 0.000
% 0.35/0.53 # Propositional solver time : 0.000
% 0.35/0.53 # Success case prop preproc time : 0.000
% 0.35/0.53 # Success case prop encoding time : 0.000
% 0.35/0.53 # Success case prop solver time : 0.000
% 0.35/0.53 # Current number of processed clauses : 13
% 0.35/0.53 # Positive orientable unit clauses : 12
% 0.35/0.53 # Positive unorientable unit clauses: 0
% 0.35/0.53 # Negative unit clauses : 1
% 0.35/0.53 # Non-unit-clauses : 0
% 0.35/0.53 # Current number of unprocessed clauses: 14
% 0.35/0.53 # ...number of literals in the above : 14
% 0.35/0.53 # Current number of archived formulas : 0
% 0.35/0.53 # Current number of archived clauses : 7
% 0.35/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.35/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.35/0.53 # Non-unit clause-clause subsumptions : 0
% 0.35/0.53 # Unit Clause-clause subsumption calls : 0
% 0.35/0.53 # Rewrite failures with RHS unbound : 0
% 0.35/0.53 # BW rewrite match attempts : 15
% 0.35/0.53 # BW rewrite match successes : 1
% 0.35/0.53 # Condensation attempts : 0
% 0.35/0.53 # Condensation successes : 0
% 0.35/0.53 # Termbank termtop insertions : 584
% 0.35/0.53
% 0.35/0.53 # -------------------------------------------------
% 0.35/0.53 # User time : 0.002 s
% 0.35/0.53 # System time : 0.001 s
% 0.35/0.53 # Total time : 0.003 s
% 0.35/0.53 # Maximum resident set size: 1428 pages
% 0.35/0.53
% 0.35/0.53 # -------------------------------------------------
% 0.35/0.53 # User time : 0.004 s
% 0.35/0.53 # System time : 0.003 s
% 0.35/0.53 # Total time : 0.006 s
% 0.35/0.53 # Maximum resident set size: 1668 pages
% 0.35/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------