TSTP Solution File: LCL434-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL434-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 23:56:51 EDT 2024
% Result : Unsatisfiable 0.38s 0.53s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 11 unt; 4 nHn; 16 RR)
% Number of literals : 34 ( 5 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_PropLog_Oweaken__right_0,axiom,
( c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).
cnf(cls_Set_OinsertE_0,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_PropLog_Othms__I_0,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms__I_0) ).
cnf(c_0_6,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_7,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__right_0]) ).
cnf(c_0_8,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
c_0_6 ).
cnf(c_0_10,plain,
( c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_7 ).
cnf(c_0_11,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).
cnf(c_0_12,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_14,negated_conjecture,
~ c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
( v_p = v_pa
| c_in(v_pa,v_H,tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ c_in(v_pa,v_H,tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
v_p = v_pa,
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
cls_PropLog_Othms__I_0 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL434-2 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n015.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 01:47:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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.38/0.53 # Version: 3.1.0
% 0.38/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.38/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.38/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.53 # Starting sh5l with 300s (1) cores
% 0.38/0.53 # new_bool_1 with pid 1120 completed with status 0
% 0.38/0.53 # Result found by new_bool_1
% 0.38/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.38/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.38/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.53 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.38/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.38/0.53 # SAT001_MinMin_p005000_rr_RG with pid 1124 completed with status 0
% 0.38/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.38/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.38/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.38/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.53 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.38/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.38/0.53 # Preprocessing time : 0.001 s
% 0.38/0.53 # Presaturation interreduction done
% 0.38/0.53
% 0.38/0.53 # Proof found!
% 0.38/0.53 # SZS status Unsatisfiable
% 0.38/0.53 # SZS output start CNFRefutation
% See solution above
% 0.38/0.53 # Parsed axioms : 6
% 0.38/0.53 # Removed by relevancy pruning/SinE : 0
% 0.38/0.53 # Initial clauses : 6
% 0.38/0.53 # Removed in clause preprocessing : 0
% 0.38/0.53 # Initial clauses in saturation : 6
% 0.38/0.53 # Processed clauses : 17
% 0.38/0.53 # ...of these trivial : 0
% 0.38/0.53 # ...subsumed : 0
% 0.38/0.53 # ...remaining for further processing : 17
% 0.38/0.53 # Other redundant clauses eliminated : 0
% 0.38/0.53 # Clauses deleted for lack of memory : 0
% 0.38/0.53 # Backward-subsumed : 0
% 0.38/0.53 # Backward-rewritten : 0
% 0.38/0.53 # Generated clauses : 8
% 0.38/0.53 # ...of the previous two non-redundant : 6
% 0.38/0.53 # ...aggressively subsumed : 0
% 0.38/0.53 # Contextual simplify-reflections : 0
% 0.38/0.53 # Paramodulations : 7
% 0.38/0.53 # Factorizations : 0
% 0.38/0.53 # NegExts : 0
% 0.38/0.53 # Equation resolutions : 0
% 0.38/0.53 # Disequality decompositions : 0
% 0.38/0.53 # Total rewrite steps : 1
% 0.38/0.53 # ...of those cached : 0
% 0.38/0.53 # Propositional unsat checks : 0
% 0.38/0.53 # Propositional check models : 0
% 0.38/0.53 # Propositional check unsatisfiable : 0
% 0.38/0.53 # Propositional clauses : 0
% 0.38/0.53 # Propositional clauses after purity: 0
% 0.38/0.53 # Propositional unsat core size : 0
% 0.38/0.53 # Propositional preprocessing time : 0.000
% 0.38/0.53 # Propositional encoding time : 0.000
% 0.38/0.53 # Propositional solver time : 0.000
% 0.38/0.53 # Success case prop preproc time : 0.000
% 0.38/0.53 # Success case prop encoding time : 0.000
% 0.38/0.53 # Success case prop solver time : 0.000
% 0.38/0.53 # Current number of processed clauses : 10
% 0.38/0.53 # Positive orientable unit clauses : 3
% 0.38/0.53 # Positive unorientable unit clauses: 0
% 0.38/0.53 # Negative unit clauses : 4
% 0.38/0.53 # Non-unit-clauses : 3
% 0.38/0.53 # Current number of unprocessed clauses: 0
% 0.38/0.53 # ...number of literals in the above : 0
% 0.38/0.53 # Current number of archived formulas : 0
% 0.38/0.53 # Current number of archived clauses : 7
% 0.38/0.53 # Clause-clause subsumption calls (NU) : 2
% 0.38/0.53 # Rec. Clause-clause subsumption calls : 2
% 0.38/0.53 # Non-unit clause-clause subsumptions : 0
% 0.38/0.53 # Unit Clause-clause subsumption calls : 5
% 0.38/0.53 # Rewrite failures with RHS unbound : 0
% 0.38/0.53 # BW rewrite match attempts : 2
% 0.38/0.53 # BW rewrite match successes : 0
% 0.38/0.53 # Condensation attempts : 0
% 0.38/0.53 # Condensation successes : 0
% 0.38/0.53 # Termbank termtop insertions : 268
% 0.38/0.53 # Search garbage collected termcells : 10
% 0.38/0.53
% 0.38/0.53 # -------------------------------------------------
% 0.38/0.53 # User time : 0.002 s
% 0.38/0.53 # System time : 0.002 s
% 0.38/0.53 # Total time : 0.004 s
% 0.38/0.53 # Maximum resident set size: 1632 pages
% 0.38/0.53
% 0.38/0.53 # -------------------------------------------------
% 0.38/0.53 # User time : 0.003 s
% 0.38/0.53 # System time : 0.004 s
% 0.38/0.53 # Total time : 0.008 s
% 0.38/0.53 # Maximum resident set size: 1696 pages
% 0.38/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------