TSTP Solution File: SWV880-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV880-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:08:03 EDT 2023
% Result : Unsatisfiable 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 18 unt; 0 nHn; 15 RR)
% Number of literals : 28 ( 9 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 35 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_image__insert_0,axiom,
c_Set_Oimage(X1,c_Set_Oinsert(X2,X3,X4),X4,X5) = c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_image__insert_0) ).
cnf(cls_conjecture_1,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_conjecture_1) ).
cnf(cls_insert__absorb_0,axiom,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_insert__absorb_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(v_pn,v_U,tc_Com_Opname),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_conjecture_3) ).
cnf(cls_insert__iff_1,axiom,
c_in(X1,c_Set_Oinsert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_insert__iff_1) ).
cnf(cls_insert__subset_2,axiom,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ c_in(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_insert__subset_2) ).
cnf(cls_empty__subsetI_0,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
file('/export/starexec/sandbox2/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p',cls_empty__subsetI_0) ).
cnf(c_0_8,axiom,
c_Set_Oimage(X1,c_Set_Oinsert(X2,X3,X4),X4,X5) = c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5),
cls_image__insert_0 ).
cnf(c_0_9,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
cls_conjecture_1 ).
cnf(c_0_10,axiom,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
cls_insert__absorb_0 ).
cnf(c_0_11,negated_conjecture,
c_in(v_pn,v_U,tc_Com_Opname),
cls_conjecture_2 ).
cnf(c_0_12,negated_conjecture,
c_Set_Oimage(v_mgt__call,c_Set_Oinsert(X1,v_U,tc_Com_Opname),tc_Com_Opname,t_a) = c_Set_Oinsert(hAPP(v_mgt__call,X1),v_G,t_a),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
c_Set_Oinsert(v_pn,v_U,tc_Com_Opname) = v_U,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a),c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
cls_conjecture_3 ).
cnf(c_0_15,axiom,
c_in(X1,c_Set_Oinsert(X1,X2,X3),X3),
cls_insert__iff_1 ).
cnf(c_0_16,negated_conjecture,
c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a) = v_G,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a),v_G,tc_fun(t_a,tc_bool)),
inference(rw,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,axiom,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ c_in(X1,X4,X3) ),
cls_insert__subset_2 ).
cnf(c_0_19,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
cls_empty__subsetI_0 ).
cnf(c_0_20,negated_conjecture,
c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWV880-1 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:39:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 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/tmp/tmp.qsBgvHEhWY/E---3.1_13373.p
% 0.16/0.51 # Version: 3.1pre001
% 0.16/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # new_bool_3 with pid 13452 completed with status 0
% 0.16/0.51 # Result found by new_bool_3
% 0.16/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.51 # Search class: FGHSM-FSLS32-DFFFFFNN
% 0.16/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.16/0.51 # SAT001_MinMin_p005000_rr_RG with pid 13455 completed with status 0
% 0.16/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.51 # Search class: FGHSM-FSLS32-DFFFFFNN
% 0.16/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.16/0.51 # Preprocessing time : 0.003 s
% 0.16/0.51 # Presaturation interreduction done
% 0.16/0.51
% 0.16/0.51 # Proof found!
% 0.16/0.51 # SZS status Unsatisfiable
% 0.16/0.51 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 507
% 0.16/0.51 # Removed by relevancy pruning/SinE : 323
% 0.16/0.51 # Initial clauses : 184
% 0.16/0.51 # Removed in clause preprocessing : 0
% 0.16/0.51 # Initial clauses in saturation : 184
% 0.16/0.51 # Processed clauses : 556
% 0.16/0.51 # ...of these trivial : 9
% 0.16/0.51 # ...subsumed : 240
% 0.16/0.51 # ...remaining for further processing : 307
% 0.16/0.51 # Other redundant clauses eliminated : 5
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 19
% 0.16/0.51 # Backward-rewritten : 0
% 0.16/0.51 # Generated clauses : 1295
% 0.16/0.51 # ...of the previous two non-redundant : 897
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 3
% 0.16/0.51 # Paramodulations : 1288
% 0.16/0.51 # Factorizations : 0
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 7
% 0.16/0.51 # Total rewrite steps : 571
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 153
% 0.16/0.51 # Positive orientable unit clauses : 47
% 0.16/0.51 # Positive unorientable unit clauses: 4
% 0.16/0.51 # Negative unit clauses : 22
% 0.16/0.51 # Non-unit-clauses : 80
% 0.16/0.51 # Current number of unprocessed clauses: 640
% 0.16/0.51 # ...number of literals in the above : 1152
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 154
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 1339
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 1140
% 0.16/0.51 # Non-unit clause-clause subsumptions : 122
% 0.16/0.51 # Unit Clause-clause subsumption calls : 157
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 84
% 0.16/0.51 # BW rewrite match successes : 73
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 30994
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.037 s
% 0.16/0.51 # System time : 0.004 s
% 0.16/0.51 # Total time : 0.041 s
% 0.16/0.51 # Maximum resident set size: 2320 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.048 s
% 0.16/0.51 # System time : 0.007 s
% 0.16/0.51 # Total time : 0.054 s
% 0.16/0.51 # Maximum resident set size: 2064 pages
% 0.16/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------