%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV553-1.004 : TPTP v8.1.0. Released v4.0.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:22:32 EDT 2022 % Result : Unsatisfiable 0.19s 0.51s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV553-1.004 : TPTP v8.1.0. Released v4.0.0. % 0.06/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n015.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jun 15 04:56:54 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 4 Number of unprocessed: 4 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 4 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 3 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 1 extension rule candidate clauses % 0.12/0.37 # 3 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 12 tableaux to operate on % 0.19/0.51 # There were 1 total branch saturation attempts. % 0.19/0.51 # There were 0 of these attempts blocked. % 0.19/0.51 # There were 0 deferred branch saturation attempts. % 0.19/0.51 # There were 0 free duplicated saturations. % 0.19/0.51 # There were 1 total successful branch saturations. % 0.19/0.51 # There were 0 successful branch saturations in interreduction. % 0.19/0.51 # There were 0 successful branch saturations on the branch. % 0.19/0.51 # There were 1 successful branch saturations after the branch. % 0.19/0.51 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.51 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.51 # Begin clausification derivation % 0.19/0.51 % 0.19/0.51 # End clausification derivation % 0.19/0.51 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.51 cnf(i_0_5, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.19/0.51 cnf(i_0_7, hypothesis, (store(store(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3,select(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3)),i4,select(store(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3,select(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3)),i4))=store(store(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3,select(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3)),i4,select(store(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3,select(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3)),i4)))). % 0.19/0.51 cnf(i_0_8, negated_conjecture, (select(a1,sk(a1,a2))!=select(a2,sk(a1,a2)))). % 0.19/0.51 cnf(i_0_6, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.19/0.51 cnf(i_0_14, plain, (X5=X5)). % 0.19/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.51 # Begin printing tableau % 0.19/0.51 # Found 6 steps % 0.19/0.51 cnf(i_0_5, plain, (select(store(X12,X13,store(X1,X11,X8)),X13)=store(X1,X11,X8)), inference(start_rule)). % 0.19/0.51 cnf(i_0_21, plain, (select(store(X12,X13,store(X1,X11,X8)),X13)=store(X1,X11,X8)), inference(extension_rule, [i_0_19])). % 0.19/0.51 cnf(i_0_42, plain, (select(store(X1,X11,X11),X11)!=X11), inference(closure_rule, [i_0_5])). % 0.19/0.51 cnf(i_0_40, plain, (select(select(store(X12,X13,store(X1,X11,X8)),X13),select(store(X1,X11,X11),X11))=select(store(X1,X11,X8),X11)), inference(extension_rule, [i_0_17])). % 0.19/0.51 cnf(i_0_54, plain, (select(store(X1,X11,X8),X11)!=X8), inference(closure_rule, [i_0_5])). % 0.19/0.51 cnf(i_0_52, plain, (select(select(store(X12,X13,store(X1,X11,X8)),X13),select(store(X1,X11,X11),X11))=X8), inference(etableau_closure_rule, [i_0_52, ...])). % 0.19/0.51 # End printing tableau % 0.19/0.51 # SZS output end % 0.19/0.51 # Branches closed with saturation will be marked with an "s" % 0.19/0.51 # Child (9614) has found a proof. % 0.19/0.51 % 0.19/0.51 # Proof search is over... % 0.19/0.51 # Freeing feature tree %------------------------------------------------------------------------------