%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT005-3 : TPTP v8.1.0. Released v1.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 : n016.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 : Sun Jul 17 04:48:25 EDT 2022 % Result : Unsatisfiable 2.49s 0.70s % Output : CNFRefutation 2.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : LAT005-3 : TPTP v8.1.0. Released v1.0.0. % 0.04/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 : n016.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 : Thu Jun 30 07:53:10 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S % 0.19/0.36 # and selection function SelectNewComplexAHP. % 0.19/0.36 # % 0.19/0.36 # Number of axioms: 19 Number of unprocessed: 19 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 19 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 1 conjectures. % 0.19/0.36 # There are 1 start rule candidates: % 0.19/0.36 # Found 15 unit axioms. % 0.19/0.36 # 1 start rule tableaux created. % 0.19/0.36 # 4 extension rule candidate clauses % 0.19/0.36 # 15 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.36 # Creating equality axioms % 0.19/0.36 # Ran out of tableaux, making start rules for all clauses % 0.19/0.36 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 29 tableaux to operate on % 2.49/0.70 # There were 1 total branch saturation attempts. % 2.49/0.70 # There were 0 of these attempts blocked. % 2.49/0.70 # There were 0 deferred branch saturation attempts. % 2.49/0.70 # There were 0 free duplicated saturations. % 2.49/0.70 # There were 1 total successful branch saturations. % 2.49/0.70 # There were 0 successful branch saturations in interreduction. % 2.49/0.70 # There were 0 successful branch saturations on the branch. % 2.49/0.70 # There were 1 successful branch saturations after the branch. % 2.49/0.70 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.49/0.70 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.49/0.70 # Begin clausification derivation % 2.49/0.70 % 2.49/0.70 # End clausification derivation % 2.49/0.70 # Begin listing active clauses obtained from FOF to CNF conversion % 2.49/0.70 cnf(i_0_28, plain, (meet(X1,n0)=n0)). % 2.49/0.70 cnf(i_0_31, plain, (join(X1,n1)=n1)). % 2.49/0.70 cnf(i_0_30, plain, (meet(X1,n1)=X1)). % 2.49/0.70 cnf(i_0_29, plain, (join(X1,n0)=X1)). % 2.49/0.70 cnf(i_0_20, plain, (meet(X1,X1)=X1)). % 2.49/0.70 cnf(i_0_21, plain, (join(X1,X1)=X1)). % 2.49/0.70 cnf(i_0_24, plain, (meet(X1,X2)=meet(X2,X1))). % 2.49/0.70 cnf(i_0_25, plain, (join(X1,X2)=join(X2,X1))). % 2.49/0.70 cnf(i_0_36, hypothesis, (complement(r1,join(a,b)))). % 2.49/0.70 cnf(i_0_37, hypothesis, (complement(r2,meet(a,b)))). % 2.49/0.70 cnf(i_0_33, plain, (meet(X1,X2)=n0|~complement(X1,X2))). % 2.49/0.70 cnf(i_0_34, plain, (join(X1,X2)=n1|~complement(X1,X2))). % 2.49/0.70 cnf(i_0_22, plain, (meet(X1,join(X1,X2))=X1)). % 2.49/0.70 cnf(i_0_23, plain, (join(X1,meet(X1,X2))=X1)). % 2.49/0.70 cnf(i_0_35, plain, (complement(X1,X2)|meet(X1,X2)!=n0|join(X1,X2)!=n1)). % 2.49/0.70 cnf(i_0_26, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 2.49/0.70 cnf(i_0_27, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 2.49/0.70 cnf(i_0_32, plain, (join(X1,meet(X3,X2))=meet(X2,join(X1,X3))|meet(X1,X2)!=X1)). % 2.49/0.70 cnf(i_0_38, negated_conjecture, (meet(join(r1,meet(r2,b)),join(r1,meet(r2,a)))!=r1)). % 2.49/0.70 cnf(i_0_49, plain, (X4=X4)). % 2.49/0.70 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.49/0.70 # Begin printing tableau % 2.49/0.70 # Found 5 steps % 2.49/0.70 cnf(i_0_28, plain, (meet(n0,n0)=n0), inference(start_rule)). % 2.49/0.70 cnf(i_0_56, plain, (meet(n0,n0)=n0), inference(extension_rule, [i_0_53])). % 2.49/0.70 cnf(i_0_99, plain, (meet(X7,n0)!=n0), inference(closure_rule, [i_0_28])). % 2.49/0.70 cnf(i_0_97, plain, (meet(meet(n0,n0),meet(X7,n0))=meet(n0,n0)), inference(extension_rule, [i_0_32])). % 2.49/0.70 cnf(i_0_114, plain, (join(meet(n0,n0),meet(X6,meet(X7,n0)))=meet(meet(X7,n0),join(meet(n0,n0),X6))), inference(etableau_closure_rule, [i_0_114, ...])). % 2.49/0.70 # End printing tableau % 2.49/0.70 # SZS output end % 2.49/0.70 # Branches closed with saturation will be marked with an "s" % 2.49/0.71 # Child (21417) has found a proof. % 2.49/0.71 % 2.49/0.71 # Proof search is over... % 2.49/0.71 # Freeing feature tree %------------------------------------------------------------------------------