TSTP Solution File: GRP044-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP044-2 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:51:38 EDT 2024
% Result : Unsatisfiable 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 11 unt; 0 nHn; 18 RR)
% Number of literals : 39 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',associativity2) ).
cnf(product_substitution3,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',product_substitution3) ).
cnf(product_with_a,hypothesis,
product(a,c,result),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_with_a) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',left_identity) ).
cnf(a_equals_b,hypothesis,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b) ).
cnf(prove_product_with_b,negated_conjecture,
~ product(b,c,result),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_product_with_b) ).
cnf(c_0_6,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_7,plain,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
inference(fof_simplification,[status(thm)],[product_substitution3]) ).
cnf(c_0_8,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_6 ).
cnf(c_0_9,hypothesis,
product(a,c,result),
product_with_a ).
cnf(c_0_10,plain,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
c_0_7 ).
cnf(c_0_11,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_12,hypothesis,
( product(X1,c,X2)
| ~ product(X3,result,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( product(identity,X1,X2)
| ~ equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
equalish(a,b),
a_equals_b ).
cnf(c_0_15,negated_conjecture,
~ product(b,c,result),
inference(fof_simplification,[status(thm)],[prove_product_with_b]) ).
cnf(c_0_16,hypothesis,
( product(X1,c,result)
| ~ product(identity,a,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,hypothesis,
product(identity,a,b),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ product(b,c,result),
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.00/0.10 % Problem : GRP044-2 : TPTP v8.2.0. Released v1.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 05:30:23 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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/benchmark/theBenchmark.p
% 0.16/0.42 # Version: 3.1.0
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # sh5l with pid 13916 completed with status 0
% 0.16/0.42 # Result found by sh5l
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.42 # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # SAT001_MinMin_p005000_rr_RG with pid 13923 completed with status 0
% 0.16/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42 # Starting sh5l with 300s (1) cores
% 0.16/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.42 # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.16/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Unsatisfiable
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 10
% 0.16/0.43 # Removed by relevancy pruning/SinE : 1
% 0.16/0.43 # Initial clauses : 9
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 9
% 0.16/0.43 # Processed clauses : 55
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 3
% 0.16/0.43 # ...remaining for further processing : 52
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 1
% 0.16/0.43 # Backward-rewritten : 0
% 0.16/0.43 # Generated clauses : 111
% 0.16/0.43 # ...of the previous two non-redundant : 80
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 111
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 27
% 0.16/0.43 # ...of those cached : 18
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 42
% 0.16/0.43 # Positive orientable unit clauses : 7
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 1
% 0.16/0.43 # Non-unit-clauses : 34
% 0.16/0.43 # Current number of unprocessed clauses: 43
% 0.16/0.43 # ...number of literals in the above : 133
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 10
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 65
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 65
% 0.16/0.43 # Non-unit clause-clause subsumptions : 4
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 0
% 0.16/0.43 # BW rewrite match successes : 0
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 1388
% 0.16/0.43 # Search garbage collected termcells : 27
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.005 s
% 0.16/0.43 # System time : 0.000 s
% 0.16/0.43 # Total time : 0.005 s
% 0.16/0.43 # Maximum resident set size: 1620 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.007 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.008 s
% 0.16/0.43 # Maximum resident set size: 1704 pages
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------