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