TSTP Solution File: GRP043-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP043-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:36:14 EDT 2023
% Result : Unsatisfiable 0.68s 0.92s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 18 RR)
% Number of literals : 32 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_substitution3,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p',product_substitution3) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p',left_identity) ).
cnf(b_equals_c,hypothesis,
equalish(b,c),
file('/export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p',b_equals_c) ).
cnf(total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p',total_function2) ).
cnf(a_equals_b,hypothesis,
equalish(a,b),
file('/export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p',a_equals_b) ).
cnf(prove_transitivity,negated_conjecture,
~ equalish(a,c),
file('/export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p',prove_transitivity) ).
cnf(c_0_6,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
product_substitution3 ).
cnf(c_0_7,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_8,plain,
( product(identity,X1,X2)
| ~ equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,hypothesis,
equalish(b,c),
b_equals_c ).
cnf(c_0_10,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_11,hypothesis,
product(identity,b,c),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( equalish(X1,X2)
| ~ product(identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,hypothesis,
equalish(a,b),
a_equals_b ).
cnf(c_0_14,negated_conjecture,
~ equalish(a,c),
prove_transitivity ).
cnf(c_0_15,hypothesis,
( equalish(X1,c)
| ~ product(identity,b,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( product(identity,X1,X2)
| ~ product(identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_17,hypothesis,
product(identity,a,b),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ product(identity,b,a),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP043-2 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:34:13 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.OosC1H8lcF/E---3.1_3056.p
% 0.68/0.92 # Version: 3.1pre001
% 0.68/0.92 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.92 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.92 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.92 # Starting sh5l with 300s (1) cores
% 0.68/0.92 # sh5l with pid 3138 completed with status 0
% 0.68/0.92 # Result found by sh5l
% 0.68/0.92 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.92 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.92 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.92 # Starting sh5l with 300s (1) cores
% 0.68/0.92 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.68/0.92 # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.68/0.92 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.68/0.92 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.68/0.92 # SAT001_MinMin_p005000_rr_RG with pid 3144 completed with status 0
% 0.68/0.92 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.68/0.92 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.92 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.92 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.92 # Starting sh5l with 300s (1) cores
% 0.68/0.92 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.68/0.92 # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.68/0.92 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.68/0.92 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.68/0.92 # Preprocessing time : 0.001 s
% 0.68/0.92 # Presaturation interreduction done
% 0.68/0.92
% 0.68/0.92 # Proof found!
% 0.68/0.92 # SZS status Unsatisfiable
% 0.68/0.92 # SZS output start CNFRefutation
% See solution above
% 0.68/0.92 # Parsed axioms : 10
% 0.68/0.92 # Removed by relevancy pruning/SinE : 1
% 0.68/0.92 # Initial clauses : 9
% 0.68/0.92 # Removed in clause preprocessing : 0
% 0.68/0.92 # Initial clauses in saturation : 9
% 0.68/0.92 # Processed clauses : 32
% 0.68/0.92 # ...of these trivial : 0
% 0.68/0.92 # ...subsumed : 0
% 0.68/0.92 # ...remaining for further processing : 32
% 0.68/0.92 # Other redundant clauses eliminated : 0
% 0.68/0.92 # Clauses deleted for lack of memory : 0
% 0.68/0.92 # Backward-subsumed : 0
% 0.68/0.92 # Backward-rewritten : 0
% 0.68/0.92 # Generated clauses : 40
% 0.68/0.92 # ...of the previous two non-redundant : 35
% 0.68/0.92 # ...aggressively subsumed : 0
% 0.68/0.92 # Contextual simplify-reflections : 0
% 0.68/0.92 # Paramodulations : 40
% 0.68/0.92 # Factorizations : 0
% 0.68/0.92 # NegExts : 0
% 0.68/0.92 # Equation resolutions : 0
% 0.68/0.92 # Total rewrite steps : 5
% 0.68/0.92 # Propositional unsat checks : 0
% 0.68/0.92 # Propositional check models : 0
% 0.68/0.92 # Propositional check unsatisfiable : 0
% 0.68/0.92 # Propositional clauses : 0
% 0.68/0.92 # Propositional clauses after purity: 0
% 0.68/0.92 # Propositional unsat core size : 0
% 0.68/0.92 # Propositional preprocessing time : 0.000
% 0.68/0.92 # Propositional encoding time : 0.000
% 0.68/0.92 # Propositional solver time : 0.000
% 0.68/0.92 # Success case prop preproc time : 0.000
% 0.68/0.92 # Success case prop encoding time : 0.000
% 0.68/0.92 # Success case prop solver time : 0.000
% 0.68/0.92 # Current number of processed clauses : 23
% 0.68/0.92 # Positive orientable unit clauses : 7
% 0.68/0.92 # Positive unorientable unit clauses: 0
% 0.68/0.92 # Negative unit clauses : 3
% 0.68/0.92 # Non-unit-clauses : 13
% 0.68/0.92 # Current number of unprocessed clauses: 20
% 0.68/0.92 # ...number of literals in the above : 52
% 0.68/0.92 # Current number of archived formulas : 0
% 0.68/0.92 # Current number of archived clauses : 9
% 0.68/0.92 # Clause-clause subsumption calls (NU) : 10
% 0.68/0.92 # Rec. Clause-clause subsumption calls : 10
% 0.68/0.92 # Non-unit clause-clause subsumptions : 0
% 0.68/0.92 # Unit Clause-clause subsumption calls : 1
% 0.68/0.92 # Rewrite failures with RHS unbound : 0
% 0.68/0.92 # BW rewrite match attempts : 0
% 0.68/0.92 # BW rewrite match successes : 0
% 0.68/0.92 # Condensation attempts : 0
% 0.68/0.92 # Condensation successes : 0
% 0.68/0.92 # Termbank termtop insertions : 609
% 0.68/0.92
% 0.68/0.92 # -------------------------------------------------
% 0.68/0.92 # User time : 0.003 s
% 0.68/0.92 # System time : 0.001 s
% 0.68/0.92 # Total time : 0.004 s
% 0.68/0.92 # Maximum resident set size: 1644 pages
% 0.68/0.92
% 0.68/0.92 # -------------------------------------------------
% 0.68/0.92 # User time : 0.003 s
% 0.68/0.92 # System time : 0.003 s
% 0.68/0.92 # Total time : 0.006 s
% 0.68/0.92 # Maximum resident set size: 1672 pages
% 0.68/0.92 % E---3.1 exiting
% 0.68/0.92 % E---3.1 exiting
%------------------------------------------------------------------------------