%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV396+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n006.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 : 600s % DateTime : Wed Jul 20 18:20:51 EDT 2022 % Result : Theorem 0.20s 0.44s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV396+1 : TPTP v8.1.0. Released v3.3.0. % 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n006.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 15 15:44:26 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.20/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.37 # % 0.20/0.37 # Number of axioms: 53 Number of unprocessed: 53 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 53 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 5 conjectures. % 0.20/0.37 # There are 5 start rule candidates: % 0.20/0.37 # Found 19 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 5 start rule tableaux created. % 0.20/0.37 # 34 extension rule candidate clauses % 0.20/0.37 # 19 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 5 % 0.20/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 9 tableaux to operate on % 0.20/0.44 # There were 2 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 2 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 2 successful branch saturations after the branch. % 0.20/0.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_8, plain, (~isnonempty_slb(create_slb))). % 0.20/0.44 cnf(i_0_53, negated_conjecture, (strictly_less_than(esk4_0,esk5_0))). % 0.20/0.44 cnf(i_0_23, plain, (update_slb(create_slb,X1)=create_slb)). % 0.20/0.44 cnf(i_0_7, plain, (less_than(bottom,X1))). % 0.20/0.44 cnf(i_0_3, plain, (less_than(X1,X1))). % 0.20/0.44 cnf(i_0_26, plain, (succ_cpq(X1,X1))). % 0.20/0.44 cnf(i_0_10, plain, (~contains_slb(create_slb,X1))). % 0.20/0.44 cnf(i_0_2, plain, (less_than(X2,X1)|less_than(X1,X2))). % 0.20/0.44 cnf(i_0_6, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))). % 0.20/0.44 cnf(i_0_29, plain, (succ_cpq(X1,findmin_cpq_eff(X2))|~succ_cpq(X1,X2))). % 0.20/0.44 cnf(i_0_5, plain, (~less_than(X1,X2)|~strictly_less_than(X2,X1))). % 0.20/0.44 cnf(i_0_4, plain, (less_than(X2,X1)|strictly_less_than(X1,X2)|~less_than(X1,X2))). % 0.20/0.44 cnf(i_0_1, plain, (less_than(X1,X3)|~less_than(X2,X3)|~less_than(X1,X2))). % 0.20/0.44 cnf(i_0_27, plain, (succ_cpq(X1,insert_cpq(X2,X3))|~succ_cpq(X1,X2))). % 0.20/0.44 cnf(i_0_28, plain, (succ_cpq(X1,remove_cpq(X2,X3))|~succ_cpq(X1,X2))). % 0.20/0.44 cnf(i_0_9, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))). % 0.20/0.44 cnf(i_0_14, plain, (~pair_in_list(create_slb,X1,X2))). % 0.20/0.44 cnf(i_0_30, plain, (succ_cpq(X1,remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)))|~succ_cpq(X1,X2))). % 0.20/0.44 cnf(i_0_19, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)). % 0.20/0.44 cnf(i_0_21, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)). % 0.20/0.44 cnf(i_0_11, plain, (contains_slb(insert_slb(X3,pair(X1,X4)),X2)|X1!=X2)). % 0.20/0.44 cnf(i_0_47, plain, (findmin_cpq_res(triple(X1,create_slb,X2))=bottom)). % 0.20/0.44 cnf(i_0_31, plain, (check_cpq(triple(X1,create_slb,X2)))). % 0.20/0.44 cnf(i_0_38, plain, (X3=bad|ok(triple(X1,X2,X3)))). % 0.20/0.44 cnf(i_0_54, negated_conjecture, (pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0))). % 0.20/0.44 cnf(i_0_12, plain, (contains_slb(insert_slb(X1,pair(X3,X4)),X2)|~contains_slb(X1,X2))). % 0.20/0.44 cnf(i_0_48, plain, (X1=create_slb|findmin_cpq_res(triple(X2,X1,X3))=findmin_pqp_res(X2))). % 0.20/0.44 cnf(i_0_22, plain, (X1=X2|lookup_slb(insert_slb(X3,pair(X1,X4)),X2)=lookup_slb(X3,X2)|~contains_slb(X3,X2))). % 0.20/0.44 cnf(i_0_15, plain, (pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)|X3!=X4|X1!=X2)). % 0.20/0.44 cnf(i_0_35, plain, (contains_cpq(triple(X3,X1,X4),X2)|~contains_slb(X1,X2))). % 0.20/0.44 cnf(i_0_43, plain, (findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad))). % 0.20/0.44 cnf(i_0_13, plain, (X2=X4|contains_slb(X1,X4)|~contains_slb(insert_slb(X1,pair(X2,X3)),X4))). % 0.20/0.44 cnf(i_0_37, plain, (~ok(triple(X1,X2,bad)))). % 0.20/0.44 cnf(i_0_25, plain, (update_slb(insert_slb(X3,pair(X4,X2)),X1)=insert_slb(update_slb(X3,X1),pair(X4,X2))|~less_than(X1,X2))). % 0.20/0.44 cnf(i_0_24, plain, (update_slb(insert_slb(X3,pair(X4,X1)),X2)=insert_slb(update_slb(X3,X2),pair(X4,X2))|~strictly_less_than(X1,X2))). % 0.20/0.44 cnf(i_0_20, plain, (X1=X2|remove_slb(insert_slb(X3,pair(X1,X4)),X2)=insert_slb(remove_slb(X3,X2),pair(X1,X4))|~contains_slb(X3,X2))). % 0.20/0.44 cnf(i_0_40, plain, (remove_cpq(triple(X3,X1,X4),X2)=triple(X3,X1,bad)|contains_slb(X1,X2))). % 0.20/0.44 cnf(i_0_36, plain, (contains_slb(X2,X4)|~contains_cpq(triple(X1,X2,X3),X4))). % 0.20/0.44 cnf(i_0_16, plain, (pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)|~pair_in_list(X1,X2,X3))). % 0.20/0.44 cnf(i_0_44, plain, (X1=create_slb|findmin_cpq_eff(triple(X2,X1,X3))=triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)|contains_slb(X1,findmin_pqp_res(X2)))). % 0.20/0.44 cnf(i_0_17, plain, (X1=X2|pair_in_list(X3,X4,X2)|~pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2))). % 0.20/0.44 cnf(i_0_18, plain, (X1=X2|pair_in_list(X3,X2,X4)|~pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4))). % 0.20/0.44 cnf(i_0_39, plain, (triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3)=insert_cpq(triple(X1,X2,X3),X4))). % 0.20/0.44 cnf(i_0_42, plain, (remove_cpq(triple(X3,X1,X4),X2)=triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)|~contains_slb(X1,X2)|~strictly_less_than(X2,lookup_slb(X1,X2)))). % 0.20/0.44 cnf(i_0_41, plain, (triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)=remove_cpq(triple(X3,X1,X4),X2)|~contains_slb(X1,X2)|~less_than(lookup_slb(X1,X2),X2))). % 0.20/0.44 cnf(i_0_51, negated_conjecture, (~pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0))). % 0.20/0.44 cnf(i_0_45, plain, (X1=create_slb|findmin_cpq_eff(triple(X2,X1,X3))=triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)|~contains_slb(X1,findmin_pqp_res(X2))|~strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))))). % 0.20/0.44 cnf(i_0_46, plain, (X1=create_slb|triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3)=findmin_cpq_eff(triple(X2,X1,X3))|~contains_slb(X1,findmin_pqp_res(X2))|~less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)))). % 0.20/0.44 cnf(i_0_34, plain, (~strictly_less_than(X1,X2)|~check_cpq(triple(X3,insert_slb(X4,pair(X1,X2)),X5)))). % 0.20/0.44 cnf(i_0_32, plain, (check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))|~less_than(X5,X4)|~check_cpq(triple(X1,X2,X3)))). % 0.20/0.44 cnf(i_0_52, negated_conjecture, (ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)))). % 0.20/0.44 cnf(i_0_33, plain, (check_cpq(triple(X1,X2,X5))|~less_than(X4,X3)|~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5)))). % 0.20/0.44 cnf(i_0_55, negated_conjecture, (pair_in_list(remove_slb(esk1_0,X1),X1,X2)|~strictly_less_than(X1,X2)|~pair_in_list(esk1_0,X1,X2)|~ok(remove_cpq(triple(X3,esk1_0,X4),X1)))). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 12 steps % 0.20/0.44 cnf(i_0_51, negated_conjecture, (~pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0)), inference(start_rule)). % 0.20/0.44 cnf(i_0_61, plain, (~pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0)), inference(extension_rule, [i_0_17])). % 0.20/0.44 cnf(i_0_467, plain, (esk4_0=esk5_0), inference(extension_rule, [i_0_11])). % 0.20/0.44 cnf(i_0_606, plain, (contains_slb(insert_slb(X14,pair(esk4_0,X13)),esk5_0)), inference(extension_rule, [i_0_12])). % 0.20/0.44 cnf(i_0_469, plain, (~pair_in_list(insert_slb(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),pair(remove_slb(insert_slb(esk4_0,pair(X21,X20)),X21),esk4_0)),esk4_0,esk5_0)), inference(extension_rule, [i_0_17])). % 0.20/0.44 cnf(i_0_683, plain, (esk4_0=esk5_0), inference(extension_rule, [i_0_15])). % 0.20/0.44 cnf(i_0_713, plain, (pair_in_list(insert_slb(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),pair(remove_slb(insert_slb(esk4_0,pair(X21,X20)),X21),esk4_0)),esk4_0,esk5_0)), inference(closure_rule, [i_0_469])). % 0.20/0.44 cnf(i_0_715, plain, (remove_slb(insert_slb(esk4_0,pair(X21,X20)),X21)!=esk4_0), inference(closure_rule, [i_0_19])). % 0.20/0.44 cnf(i_0_685, plain, (~pair_in_list(insert_slb(insert_slb(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),pair(remove_slb(insert_slb(esk4_0,pair(X21,X20)),X21),esk4_0)),pair(X19,esk4_0)),esk4_0,esk5_0)), inference(extension_rule, [i_0_18])). % 0.20/0.44 cnf(i_0_764, plain, (esk5_0=esk4_0), inference(closure_rule, [i_0_683])). % 0.20/0.44 cnf(i_0_630, plain, (contains_slb(insert_slb(insert_slb(X14,pair(esk4_0,X13)),pair(X11,X12)),esk5_0)), inference(etableau_closure_rule, [i_0_630, ...])). % 0.20/0.44 cnf(i_0_766, plain, (~pair_in_list(insert_slb(insert_slb(insert_slb(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),pair(remove_slb(insert_slb(esk4_0,pair(X21,X20)),X21),esk4_0)),pair(X19,esk4_0)),pair(esk5_0,X10)),esk4_0,esk5_0)), inference(etableau_closure_rule, [i_0_766, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Child (900) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------