TSTP Solution File: SYN581-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN581-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 20:17:51 EDT 2023
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 47 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p11_21,negated_conjecture,
( p11(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p11(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p11_21) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p2_2) ).
cnf(p2_14,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p2_14) ).
cnf(p11_8,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p11_8) ).
cnf(p2_18,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p2_18) ).
cnf(not_p11_9,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',not_p11_9) ).
cnf(p2_5,negated_conjecture,
p2(c18,c14),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p2_5) ).
cnf(p2_23,negated_conjecture,
( p2(f6(X1,X2),f6(X3,X4))
| ~ p2(X2,X4)
| ~ p5(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p2_23) ).
cnf(p5_3,negated_conjecture,
p5(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.n94IdRnqeb/E---3.1_18795.p',p5_3) ).
cnf(c_0_9,negated_conjecture,
( p11(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p11(X3,X4) ),
p11_21 ).
cnf(c_0_10,negated_conjecture,
p2(X1,X1),
p2_2 ).
cnf(c_0_11,negated_conjecture,
( p11(X1,X2)
| ~ p11(X3,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
p2_14 ).
cnf(c_0_13,negated_conjecture,
( p11(f4(X1),X2)
| ~ p11(f4(X3),X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
p11(f4(f6(c15,c14)),c16),
p11_8 ).
cnf(c_0_15,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
p2_18 ).
cnf(c_0_16,negated_conjecture,
~ p11(f4(f6(c15,c18)),c16),
not_p11_9 ).
cnf(c_0_17,negated_conjecture,
( p11(f4(X1),c16)
| ~ p2(f6(c15,c14),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
p2(c18,c14),
p2_5 ).
cnf(c_0_20,negated_conjecture,
~ p2(f6(c15,c14),f6(c15,c18)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( p2(f6(X1,X2),f6(X3,X4))
| ~ p2(X2,X4)
| ~ p5(X1,X3) ),
p2_23 ).
cnf(c_0_22,negated_conjecture,
p5(X1,X1),
p5_3 ).
cnf(c_0_23,negated_conjecture,
p2(c14,c18),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SYN581-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Oct 2 18:26:04 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.36 Running first-order theorem proving
% 0.13/0.36 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.n94IdRnqeb/E---3.1_18795.p
% 0.13/0.42 # Version: 3.1pre001
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # Starting sh5l with 300s (1) cores
% 0.13/0.42 # sh5l with pid 18924 completed with status 0
% 0.13/0.42 # Result found by sh5l
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # Starting sh5l with 300s (1) cores
% 0.13/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.42 # Search class: FGUNS-FFMS21-SFFFFFNN
% 0.13/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.42 # SAT001_MinMin_p005000_rr_RG with pid 18931 completed with status 0
% 0.13/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # Starting sh5l with 300s (1) cores
% 0.13/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.42 # Search class: FGUNS-FFMS21-SFFFFFNN
% 0.13/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.42 # Preprocessing time : 0.001 s
% 0.13/0.42 # Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 # Proof found!
% 0.13/0.42 # SZS status Unsatisfiable
% 0.13/0.42 # SZS output start CNFRefutation
% See solution above
% 0.13/0.42 # Parsed axioms : 25
% 0.13/0.42 # Removed by relevancy pruning/SinE : 0
% 0.13/0.42 # Initial clauses : 25
% 0.13/0.42 # Removed in clause preprocessing : 0
% 0.13/0.42 # Initial clauses in saturation : 25
% 0.13/0.42 # Processed clauses : 1405
% 0.13/0.42 # ...of these trivial : 5
% 0.13/0.42 # ...subsumed : 852
% 0.13/0.42 # ...remaining for further processing : 548
% 0.13/0.42 # Other redundant clauses eliminated : 0
% 0.13/0.42 # Clauses deleted for lack of memory : 0
% 0.13/0.42 # Backward-subsumed : 14
% 0.13/0.42 # Backward-rewritten : 1
% 0.13/0.42 # Generated clauses : 4148
% 0.13/0.42 # ...of the previous two non-redundant : 3779
% 0.13/0.42 # ...aggressively subsumed : 0
% 0.13/0.42 # Contextual simplify-reflections : 1
% 0.13/0.42 # Paramodulations : 4148
% 0.13/0.42 # Factorizations : 0
% 0.13/0.42 # NegExts : 0
% 0.13/0.42 # Equation resolutions : 0
% 0.13/0.42 # Total rewrite steps : 952
% 0.13/0.42 # Propositional unsat checks : 0
% 0.13/0.42 # Propositional check models : 0
% 0.13/0.42 # Propositional check unsatisfiable : 0
% 0.13/0.42 # Propositional clauses : 0
% 0.13/0.42 # Propositional clauses after purity: 0
% 0.13/0.42 # Propositional unsat core size : 0
% 0.13/0.42 # Propositional preprocessing time : 0.000
% 0.13/0.42 # Propositional encoding time : 0.000
% 0.13/0.42 # Propositional solver time : 0.000
% 0.13/0.42 # Success case prop preproc time : 0.000
% 0.13/0.42 # Success case prop encoding time : 0.000
% 0.13/0.42 # Success case prop solver time : 0.000
% 0.13/0.42 # Current number of processed clauses : 508
% 0.13/0.42 # Positive orientable unit clauses : 25
% 0.13/0.42 # Positive unorientable unit clauses: 0
% 0.13/0.42 # Negative unit clauses : 8
% 0.13/0.42 # Non-unit-clauses : 475
% 0.13/0.42 # Current number of unprocessed clauses: 2405
% 0.13/0.42 # ...number of literals in the above : 7915
% 0.13/0.42 # Current number of archived formulas : 0
% 0.13/0.42 # Current number of archived clauses : 40
% 0.13/0.42 # Clause-clause subsumption calls (NU) : 68719
% 0.13/0.42 # Rec. Clause-clause subsumption calls : 52586
% 0.13/0.42 # Non-unit clause-clause subsumptions : 857
% 0.13/0.42 # Unit Clause-clause subsumption calls : 1405
% 0.13/0.42 # Rewrite failures with RHS unbound : 0
% 0.13/0.42 # BW rewrite match attempts : 11
% 0.13/0.42 # BW rewrite match successes : 1
% 0.13/0.42 # Condensation attempts : 0
% 0.13/0.42 # Condensation successes : 0
% 0.13/0.42 # Termbank termtop insertions : 53442
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.051 s
% 0.13/0.42 # System time : 0.002 s
% 0.13/0.42 # Total time : 0.053 s
% 0.13/0.42 # Maximum resident set size: 1624 pages
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.053 s
% 0.13/0.42 # System time : 0.002 s
% 0.13/0.42 # Total time : 0.055 s
% 0.13/0.42 # Maximum resident set size: 1692 pages
% 0.13/0.42 % E---3.1 exiting
% 0.13/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------